Related papers: Limits of the Tristram--Levine signature function

We prove an O(log n) bound for the expected value of the logarithm of the componentwise (and, a fortiori, the mixed) condition number of a random sparse n x n matrix. As a consequence, small bounds on the average loss of accuracy for…

We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two…

We use the idea of expressing a nonoriented link as a sum of all oriented links corresponding to the link to present a short proof of the Lickorish-Millett-Turaev formula for the Kauffman polynomial at $z= -a- a^{-1}$. Our approach explains…

We give a simple bijective proof of associativity and commutativity of the Littlewood-Richardson coefficients or the hive ring. Specifically, we establish existence a polarized polymatroidal discretely concave functions on the tetrahedron…

The signature of a rectifiable path is a tensor series in the tensor algebra whose coefficients are definite iterated integrals of the path. The signature characterises the path up to a generalised form of reparametrisation. It is a…

A formula for the Alexander polynomial of a 2-bridge knot or link given by Hartley and also by Minkus has a beautiful interpretation as a walk on the integers. We extend this to the 2-variable Alexander polynomial of a 2-bridge link,…

We consider the Reidemeister torsion associated with SL(2, C)-representations of a knot group. A bifurcation point in the SL(2, C)-character variety of a knot group is a character which is given by both an abelian SL(2, C)-representation…

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…

We give a concise proof of a classification of lens spaces up to orientation-preserving homeomorphisms. The chief ingredient in our proof is a study of the Alexander polynomial of ` symmetric' links in $S^3$.

The spectrum of an arbitrary self-adjoint extension of the minimal linear relation associated with the discrete symplectic system in the limit point case is completely characterized by using the limiting Weyl--Titchmarsh…

If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…

In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…

We provide a recursive classification of meander graphs, showing that each meander is identified by a unique sequence of fundamental graph-theoretic moves. This sequence is called the meander's signature. The signature not only provides a…

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a…

In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…

We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…

We give a multivariate version of Descartes' rule of signs to bound the number of positive real roots of a system of polynomial equations in n variables with n+2 monomials, in terms of the sign variation of a sequence associated both to the…

For martingales with a wide range of integrability, we will quantify the rate of convergence of the central limit theorem via Wasserstein distances of order $r$, $1\le r\le 3$. Our bounds are in terms of Lyapunov's coefficients and the…

The paper bounds the number of tessellations with T-shaped vertices on a fixed set of $k$ lines: tessellations are efficiently encoded, and algorithms retrieve them, proving injectivity. This yields existence of a completely random…