Related papers: A sharp signature bound for positive four-braids
A totally oriented Klein graph is a trivalent spatial graph in the 3-sphere with a 3-coloring of its edges and an orientation on each bicolored link. A totally oriented Klein foam is a 3-colored 2-complex in the 4-ball whose boundary is a…
We establish two results on three-dimensional del Pezzo fibrations in positive characteristic. First, we give an explicit bound for torsion index of relatively torsion line bundles. Second, we show the existence of purely inseparable…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
It was asked by J.Birman, Williams, and L.Rudolph whether nontrivial Lorentz knots have always positive signature. Lorentz knots are examples of positive braids (in our convention they have all crossings negative so they are negative…
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that some of our upper bounds are sharp for 3 and 4-regular…
We improve the Bend-and-Break result of Miyaoka and Mori by establishing the optimal degree bound. Our result also yields optimal bounds on lengths of extremal rays of log canonical pairs.
By considering negative surgeries on a knot $K$ in $S^3$, we derive a lower bound to the non-orientable slice genus $\gamma_4(K)$ in terms of the signature $\sigma(K)$ and the concordance invariants $V_i(\overline{K})$, which strengthens a…
We study the Morton-Franks-Williams inequality for closures of simple braids (also known as positive permutation braids). This allows to prove, in a simple way, that the set of simple braids is a orthonormal basis for the inner product of…
Let f: X->B be a fibred surface of genus g whose general fibre is a double cover of a smooth curve of genus gamma. We show that, for g > 4gamma+1, the number 4(g-1)/(g-gamma) is a sharp lower bound for the slope of f, proving a conjecture…
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…
We derive a uniform bound for the total betti number of a closed manifold in terms of a Ricci curvature lower bound, a conjugate radius lower bound and a diameter upper bound. The result is based on an angle version of Toponogov comparison…
To a Seifert matrix of a knot K one can associate a matrix w(K) with entries in the rational function field, Q(t). The Murasugi, Milnor, and Levine-Tristram knot signatures, all of which provide bounds on the 4-genus of a knot, are…
In the present paper, we consider upper bounds of higher linear syzygies i.e. graded Betti numbers in the first linear strand of the minimal free resolutions of projective varieties in arbitrary characteristic. For this purpose, we first…
There exist knots having positive and negative four-dimensional clasp numbers zero but having four-genus, and hence clasp number, arbitrarily large. Such examples were first constructed by Allison Miller, answering a question of…
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
We prove a tight lower bound on the Betti numbers of tree and forest ideals and a tight upper bound on certain graded Betti numbers of squarefree monomial ideals.
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…