scholarly journals An effective and sharp lower bound on Seshadri constants on surfaces with Picard number 1

2008 ◽  
Vol 319 (8) ◽  
pp. 3112-3119 ◽  
Author(s):  
Tomasz Szemberg
Keyword(s):  
Lower Bound ◽  
Picard Number ◽  
Seshadri Constants ◽  
Sharp Lower Bound

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

scholarly journals Compactness and Sharp Lower Bound for a 2D Smectics Model

2021 ◽  
Vol 31 (3) ◽  
Author(s):  
Michael Novack ◽  
Xiaodong Yan
Keyword(s):  
Lower Bound ◽  
Sharp Lower Bound

Success probabilities for second guessers

1980 ◽  
Vol 17 (04) ◽  
pp. 1133-1137 ◽  
Author(s):  
A. O. Pittenger
Keyword(s):  
Lower Bound ◽  
Dimensional Space ◽  
Success Probability ◽  
First Person ◽  
True Location ◽  
Rotationally Symmetric ◽  
The One ◽  
Sharp Lower Bound

Two people independently and with the same distribution guess the location of an unseen object in n-dimensional space, and the one whose guess is closer to the unseen object is declared the winner. The first person announces his guess, but the second modifies his unspoken idea by moving his guess in the direction of the first guess and as close to it as possible. It is shown that if the distribution of guesses is rotationally symmetric about the true location of the unseen object, ¾ is the sharp lower bound for the success probability of the second guesser. If the distribution is fixed and the dimension increases, then for a certain class of distributions, the success probability approaches 1.

scholarly journals Seshadri constants on surfaces with Picard number 1

2016 ◽  
Vol 153 (3-4) ◽  
pp. 535-543
Author(s):  
Krishna Hanumanthu
Keyword(s):  
Picard Number ◽  
Seshadri Constants

ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS

2015 ◽  
Vol 91 (3) ◽  
pp. 353-367 ◽  
Author(s):  
JING HUANG ◽  
SHUCHAO LI
Keyword(s):  
Lower Bound ◽  
Characteristic Polynomial ◽  
Regular Graph ◽  
Spanning Trees ◽  
Line Graph ◽  
Laplacian Spectrum ◽  
Kirchhoff Index ◽  
Subdivision Graph ◽  
Number Of Spanning Trees ◽  
Sharp Lower Bound

Given a connected regular graph $G$, let $l(G)$ be its line graph, $s(G)$ its subdivision graph, $r(G)$ the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and joining each new vertex to the end vertices of the corresponding edge and $q(G)$ the graph obtained from $G$ by inserting a new vertex into every edge of $G$ and new edges joining the pairs of new vertices which lie on adjacent edges of $G$. A formula for the normalised Laplacian characteristic polynomial of $l(G)$ (respectively $s(G),r(G)$ and $q(G)$) in terms of the normalised Laplacian characteristic polynomial of $G$ and the number of vertices and edges of $G$ is developed and used to give a sharp lower bound for the degree-Kirchhoff index and a formula for the number of spanning trees of $l(G)$ (respectively $s(G),r(G)$ and $q(G)$).

Sharp lower bounds on the sum-connectivity index of quasi-tree graphs

2021 ◽  
pp. 2150136
Author(s):  
Amir Taghi Karimi
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Connectivity Index ◽  
Tree Graphs ◽  
Sharp Lower Bound

The sum-connectivity index of a graph [Formula: see text] is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] and [Formula: see text] are the degrees of the vertices [Formula: see text] and [Formula: see text] in [Formula: see text], respectively. A graph [Formula: see text] is called quasi-tree, if there exists [Formula: see text] such that [Formula: see text] is a tree. In the paper, we give a sharp lower bound on the sum-connectivity index of quasi-tree graphs.

Sign in / Sign up

Export Citation Format

Share Document