arXiv research

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 …

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

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.

Characterizes adequate links using Jones polynomial and crossing number.

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 …

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…

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.

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

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…

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

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 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…

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.

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

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…

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…

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 …

Graph Convolutional Networks (GCNs) have proved to be a most powerful architecture in aggregating local neighborhood information for individual graph nodes. Low-rank proximities and node features are successfully leveraged in existing GCNs, however, attributes that graph links may carry are commonly ignored, as almost …

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…

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…

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

The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope conjecture to links. We prove the conjecture for all alternating and more generally adequ…

This paper explores Khovanov adequacy in knot theory.

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequac…

We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques from skein theory.

Proves minimal crossing diagrams for specific spatial graphs.

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…

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-…

Effectively modelling hidden structures in a network is very practical but theoretically challenging. Existing relational models only involve very limited information, namely the binary directional link data, embedded in a network to learn hidden networking structures. There is other rich and meaningful information (e.…

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…

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

Jones polynomial bounds and crossing numbers of knots.

New insights into Khovanov homology complexity and topological structure.

The performance of trend following strategies can be ascribed to the difference between long-term and short-term realized variance. We revisit this general result and show that it holds for various definitions of trend strategies. This explains the positive convexity of the aggregate performance of Commodity Trading Ad…

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…

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…

Deep ResNets exhibit distinct scaling properties with depth, challenging neural ODE models.

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…

A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.

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…

Although a great methodological effort has been invested in proposing competitive solutions to the class-imbalance problem, little effort has been made in pursuing a theoretical understanding of this matter. In order to shed some light on this topic, we perform, through a novel framework, an exhaustive analysis of the …

Transformer models outperform LSTM in financial forecasting with MADL loss.

With the growth of user-generated content, we observe the constant rise of the number of companies, such as search engines, content aggregators, etc., that operate with tremendous amounts of web content not being the services hosting it. Thus, aiming to locate the most important content and promote it to the users, the…

The main goal of this article is to obtain a condition under which an infinite collection $\mathscr{F}$ of satellite knots (with companion a positive torus knot and pattern similar to the Whitehead link) freely generates a subgroup of infinite rank in the smooth concordance group. This goal is attained by examining bot…

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…

We observe that the strong slope conjecture implies that the degree of the colored Jones polynomial detects all torus knots. As an application we obtain that an adequate knot that has the same colored Jones polynomial degrees as a torus knot must be a $(2,q)$-torus knot.

This expository paper presents elementary proofs of four basic results concerning derivatives of quasi-convex functions. They are combined into a fifth theorem which is simple to apply and adequate in many cases. Along the way we establish the equivalence of the basic lemmas of Jensen and Slodkowski.