Related papers: Bounds on numerical boundary slopes for Montesinos…

We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.

We consider irreducible 3-manifolds M that arise as knot complements in closed 3-manifolds and that contain at most two connected strict essential surfaces. The results in the paper relate the boundary slopes of the two surfaces to their…

For a fixed marked surface $S$, we construct polynomial bounds on the periodic and preperiodic lengths of the maximal splitting sequences of a projectively invariant measured train track. We give two consequences of these bounds. Firstly,…

Some elementary inequalities providing upper bounds for the difference of the norm and the numerical radius of a bounded linear operator on Hilbert spaces under appropriate conditions are given.

This paper contains a set of lecture notes on manifolds with boundary and corners, with particular attention to the space of quantum states. A geometrically inspired way of dealing with these kind of manifolds is presented,and explicit…

We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…

We give upper and lower bounds on the number of points on abelian varieties over finite fields, and lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian…

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

We establish an upper bound for the Thurston-Bennequin number of a Legendrian link using the Khovanov homology of the underlying topological link. This bound is sharp in particular for all alternating links, and knots with nine or fewer…

For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.

We obtain bounds for the numerical radius of $2 \times 2$ operator matrices which improve on the existing bounds. We also show that the inequalities obtained here generalize the existing ones. As an application of the results obtained here…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…

The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov…

We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We obtain several new upper bounds of the odd graceful chromatic number of a graph $G$, which must be bipartite. Some of our bounds depend only on the number of the vertices of $G$ or the chromatic number of some graphs related to the…

We give lower bounds for the tunnel number of knots and handlebody-knots. We also give a lower bound for the cutting number, which is a "dual" notion to the tunnel number in the handlebody-knot theory. We provide necessary conditions for…

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…