arXiv research

In this paper, we characterize the sigma-adequacy of a link diagram in two ways: in terms of a certain edge subset of its Tait graph and in terms of a certain product of Tutte polynomials. Furthermore, we show that the symmetrized Tutte polynomial of the Tait graph of a link diagram can be written as a sum of these pro…

Refines virtual link equality criterion for diagrams with one virtual crossing.

Proves minimal crossing diagrams for specific spatial graphs.

The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the converse; if the bounds are sharp then the diagram is semi-adequate. As a result,…

The paper develops a theory of skein adequate links in thickened surfaces and proves Tait conjectures.

We show that the head and tail functions of the colored Jones polynomial of adequate links are the product of head and tail functions of the colored Jones polynomial of alternating links that can be read-off an adequate diagram of the link. We apply this to strengthen a theorem of Kalfagianni, Futer and Purcell on the …

The class of +adequate links contains both alternating and positive links. Generalizing results of Tanaka (for the positive case) and Ng (for the alternating case), we construct fronts of an arbitrary +adequate link A so that the diagram has a ruling, therefore its Thurston-Bennequin number is maximal among Legendrian …

We bound the hyperbolic volumes of a large class of knots and links, called homogeneously adequate knots and links, in terms of their diagrams. To do so, we use the decomposition of these links into ideal polyhedra, developed by Futer, Kalfagianni, and Purcell. We identify essential product disks in these polyhedra.

We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then restrict our attention to plat closures of certain braids, a rich family of links who…

In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given closed braid diagram. We also show that the volumes for many of these closed braids…

Jones polynomial bounds and crossing numbers of knots.

New insights into Khovanov homology complexity and topological structure.

We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating diagrams of the same link have the same writhe. This result is proved more general…

This paper continues our study, initiated in [arXiv:1108.3370], of essential state surfaces in link complements that satisfy a mild diagrammatic hypothesis (homogeneously adequate). For hyperbolic links, we show that the geometric type of these surfaces in the Thurston trichotomy is completely determined by a simple gr…

This paper explores Khovanov adequacy in knot theory.

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of essential surfaces and the hyperbolic volume of their complements: we show that the Str…

In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing) but the great flow of ideas started only after Jones discoveries. The first dee…

Every Kauffman state σof a link diagram D(K) naturally defines a state surface S_σwhose boundary is K. For a homogeneous state σ, we show that K is a fibered link with fiber surface S_σif and only if an associated graph G'_σis a tree. As a corollary, it follows that for an adequate knot or link, the second and next-to-…

$R$-coloured knot polynomials for $m$-strand torus knots $Torus_{[m,n]}$ are described by the Rosso-Jones formula, which is an example of evolution in $n$ with Lyapunov exponents, labelled by Young diagrams from $R^{\otimes m}$. This means that they satisfy a finite-difference equation (recursion) of finite degree. For…

A link is adequate and has Turaev genus one if its Jones polynomial span is one less than its crossing number.

Study shows crossing numbers of cable knots are larger than previously thought.

We provide a diagrammatic criterion for semi-adequate links to be hyperbolic. We also give a conjectural description of the satellite structures of semi-adequate links. One application of our result is that the closures of sufficiently complicated positive braids are hyperbolic links.

Generating eye diagrams by using a circuit simulator can be very computationally intensive, especially in the presence of nonlinearities. It often involves multiple Newton-like iterations at every time step when a SPICE-like circuit simulator handles a nonlinear system in the transient regime. In this paper, we leverag…

Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their ability to represent uncertainty about predictions. In safety-critical applicatio…

We prove a conjecture of Rozansky's concerning his categorification of the tail of the colored Jones polynomial for an $A$-adequate link. We show that the tail homology groups he constructs are trivial for non $A$-adequate links.

It is known that the colored Jones polynomial of a $+$-adequate link has a well-defined tail consisting of stable coefficients, and that the coefficients of the tail carry geometric and topological information on the $+$-adequate link complement. We show that a power series similar to the tail of the colored Jones poly…

Characterizes adequate links using Jones polynomial and crossing number.

Given a connect sum of link diagrams, there is an isomorphism which decomposes unnormalized Khovanov chain groups for the product in terms of normalized chain groups for the factors; this isomorphism is straightforward to see on the level of chains. Similarly, any plumbing $x*y$ of Kauffman states carries an isomorphis…

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mech…

Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We verify this conjecture for adequate knots, a class that vastly generalizes that o…

The twisting technique creates infinite links.

The goal of this paper is to address A. Shumakovitch's conjecture about the existence of $\Z_2$-torsion in Khovanov link homology. We analyze torsion in Khovanov homology of semi-adequate links via chromatic cohomology for graphs which provides a link between the link homology and well-developed theory of Hochschild ho…

C. Armond, S. Garoufalidis and T.Le have shown that a unicolored Jones polynomial of a B-adequate link has a stable tail at large colors. We categorify this tail by showing that Khovanov homology of a unicolored link also has a stable tail, whose graded Euler characteristic coincides with the tail of the Jones polynomi…

We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and the essential surfaces that realize the slopes .For alternating knots the refor…

We define a Khovanov homotopy type for $sl_2(\mathbb{C})$ colored links and quantum spin networks and derive some of its basic properties. In the case of $n$-colored B-adequate links, we show a stabilization of the homotopy types as the coloring $n\rightarrow\infty$, generalizing the tail behavior of the colored Jones …

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

This note explains how to transform Heegaard diagrams into framed link diagrams.

Paper proves zero stability for one-row colored sl₃-Jones polynomials.

New minimal link diagrams found, including torus links and homogeneous ones.

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

Study links' arc index and Turaev genus, proving conjectures.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …

Problems on region choices for knot and link diagrams solved using Alexander numbering.