Related papers: The Jones Polynomial from a Goeritz Matrix
We consider families of polynomial lemniscates in the complex plane and determine if they bound a Jordan domain. This allows us to find examples of regions for which we can calculate the projection of $\bar{z}$ to the Bergman space of the…
Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…
In this paper, we introduce \textit{graph-pretzel links}, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to…
We provide a combinatorial interpretation of the Kazhdan--Lusztig polynomial of the matroid arising from the braid arrangement of type $\mathrm{A}_{n-1}$, which gives an interpretation of the intersection cohomology Betti numbers of the…
We find approximations by Vassiliev invariants for the coefficients of the Jones polynomial and all specializations of the HOMFLY and Kauffman polynomials. Consequently, we obtain approximations of some other link invariants arising from…
The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded…
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…
Matrix normal models have an associated 4-tensor for their covariance representation. The covariance array associated with a matrix normal model is naturally represented as a Kronecker-product structured covariance associated with the…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We consider the Alexander polynomial of a plane algebraic curve twisted by a linear representation. We show that it divides the product of the polynomials of the singularity links, for unitary representations. Moreover, their quotient is…
An effective algebraic approach to $S$--matrix factorization into Jost matrices is developed in the case of coupled channels. The Jost matrix is given as a solution of boundary value Riemann -- Hilbert problem. A rational form is assumed…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
We describe the Lorenz links generated by renormalizable Lorenz maps with reducible kneading invariant $(K_f^-,K_f^+)=(X,Y)*(S,W)$, in terms of the links corresponding to each factor. This gives one new kind of operation that permits us to…
We propose an algorithm which allows to derive the generalized Alexander polynomial invariants of knots and links with the help of the q,p-numbers, appearing in bosonic two-parameter quantum algebra. These polynomials turn into HOMFLY ones…
We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
In Guts, Volume and Skein Modules of 3-Manifolds (arXiv:2010.06559), we showed that the twist number of certain hyperbolic weakly generalized alternating links can be recovered from a Jones-like polynomial, and offers a lower bound for the…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…