Related papers: A Note on Alternating Links and Root Polytopes
We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers…
J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the…
We compute the Jones polynomial for a three-parameter family of links, the twisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime and $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…
Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…
We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…
We show that if {L_n} is any infinite sequence of links with twist number tau(L_n) and with cyclotomic Jones polynomials of increasing span, then lim sup tau(L_n)=infty. This implies that any infinite sequence of prime alternating links…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
To any prime alternating link, we associate a collection of hyperbolic right-angled ideal polyhedra by relating geometric, topological and combinatorial methods to decompose the link complement. The sum of the hyperbolic volumes of these…
The association of a given human phenotype to a genetic variant remains a critical challenge for biology. We present a novel system called PhenoLinker capable of associating a score to a phenotype-gene relationship by using heterogeneous…
Let L \subset S^3 denote an alternating link and Sigma(L) its branched double-cover. We give a short proof of the fact that the fundamental group of Sigma(L) admits a left-ordering iff L is an unlink. This result is originally due to…
Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual links: the cut point number. Checkerboard framings and cut…
In this paper we review the definitions of homogeneous and alternative links. We also give two new characterizations of an alternative link diagram, one within the context of the enhanced checkerboard graph and another from the labeled…
We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…
A model of random walk on knot diagrams is used to study the Alexander polynomial and the colored Jones polynomial of knots. In this context, the inverse of the Alexander polynomial of a knot plays the role of an Ihara-Selberg zeta function…
By using motivic homotopy theory, we introduce a counterpart in algebraic geometry to oriented links and their linking numbers. After constructing the (ambient) quadratic linking degree -- our analogue of the linking number which takes…
The entropic discriminant is a non-negative polynomial associated to a matrix. It arises in contexts ranging from statistics and linear programming to singularity theory and algebraic geometry. It describes the complex branch locus of the…