English
Related papers

Related papers: Integer inequalities between knot invariants, skei…

200 papers

Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…

Data Structures and Algorithms · Computer Science 2024-07-02 Ivan Hu , Dieter van Melkebeek , Andrew Morgan

We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen $s$-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension $2^{|L|}$. The basic…

Geometric Topology · Mathematics 2012-08-14 John Pardon

We prove that the detection rate of n-crossing alternating links by many standard link invariants decays exponentially in n, implying that they detect alternating links with probability zero. This phenomenon applies broadly, in particular…

Geometric Topology · Mathematics 2025-12-02 Tuomas Kelomäki , Abel Lacabanne , Daniel Tubbenhauer , Pedro Vaz , Victor L. Zhang

The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…

Geometric Topology · Mathematics 2016-08-03 Stavros Garoufalidis , Roland van der Veen

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…

Geometric Topology · Mathematics 2016-11-26 Michael Brandenbursky

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

Geometric Topology · Mathematics 2014-10-01 Thomas Fleming , Blake Mellor

New invariants of links are constructed using the skein invariant polynomial of colored links defined by the author in [1]. These invariants are stronger than the homflypt polynomial.

Geometric Topology · Mathematics 2015-12-11 Francesca Aicardi

The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…

Geometric Topology · Mathematics 2026-01-16 Hyungkee Yoo

Two new invariants that are closely related to Milnor's curvature-torsion invariant are introduced. The first, the spiral index of a knot, captures the minimum number of maxima among all knot projections that are free of inflection points.…

Geometric Topology · Mathematics 2011-08-30 Colin Adams , William George , Rachel Hudson , Ralph Morrison , Laura Starkston , Samuel Taylor , Olga Turanova

We find a single two-parameter skein relation on trivalent graphs, the quantum exceptional relation, that specializes to a skein relation associated to each exceptional Lie algebra (in the adjoint representation). If a slight strengthening…

Quantum Algebra · Mathematics 2025-04-09 Kim Morrison , Noah Snyder , Dylan P. Thurston

In this article, we explore a polynomial invariant for Legendrian knots which is a natural extension of Jones polynomial for (topological) knots. To this end, a new type of skein relation is introduced for the front projections of…

Geometric Topology · Mathematics 2025-10-07 Dheeraj Kulkarni , Monika Yadav

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

Geometric Topology · Mathematics 2024-01-15 Dror Bar-Natan , Itai Bar-Natan , Iva Halacheva , Nancy Scherich

A number of results for the level-rank duality of $G(N)_K$ $\leftrightarrow$ $G(K)_N$ Chern-Simons theory are summarized, with emphasis on the applications to knot and link invariants. Explicit examples for $SU(2)_K$ $\leftrightarrow$…

Geometric Topology · Mathematics 2021-10-19 Howard J. Schnitzer

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

Geometric Topology · Mathematics 2023-04-04 Jundai Nanasawa

We introduce two numerical invariants, the waist and the trunk of knots. The waist of a closed incompressible surface in the complement of a knot is defined as the minimal intersection number of all compressing disks for the surface in the…

Geometric Topology · Mathematics 2009-06-01 Makoto Ozawa

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

Geometric Topology · Mathematics 2010-08-03 Danielle O'Donnol

A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…

Mathematical Physics · Physics 2023-03-09 Shinobu Hikami

A new algebraic method for computing helicity is developed, by discovering a relationship between helicity of fluid mechanics and algebraic polynomial invariants of knot theory. We have constructed a topological invariant…

Fluid Dynamics · Physics 2010-07-29 Xin Liu

The purpose of this paper is to present a certain combinatorial method of constructing invariants of isotopy classes of oriented tame links. This arises as a generalization of the known polynomial invariants of Conway and Jones. These…

Geometric Topology · Mathematics 2016-10-24 Jozef H. Przytycki , Pawel Traczyk

The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in…

Data Structures and Algorithms · Computer Science 2016-08-23 Andre Droschinsky , Nils M. Kriege , Petra Mutzel
‹ Prev 1 3 4 5 6 7 10 Next ›