Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

6121723 · May 202219922001200920172026
48 results for tangle diagrams

We note that a rational 33-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational 33-tangle diagrams up to isotopy. However, there is no perfect classification about rational 33-tangle diagrams such as the classification of rational 22-tangle diagrams cor…

2015-02-19abs ↗pdf ↗

Study on coloring virtual tangles with integer and modular arithmetic.

problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=ZR=\mathbb{Z}, realizability depends on divisibility of the alternating sum. For R=Z/pZR=\mathbb{Z}/p\mathbb{Z}, all vectors are realizable.

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of non-trivial colorings for the tangles in question. Our main result in this article i…

2019-04-11abs ↗pdf ↗

This paper is a short introduction to the combinatorial version of tangle Floer homology defined in "Combinatorial tangle Floer homology". There are two equivalent definitions---one in terms of strand diagrams, and one in terms of bordered grid diagrams. We present both, discuss the correspondence, and carry out some e…

2016-04-28abs ↗pdf ↗

It is known that there are 21 ribbon knots with 10 crossings or fewer. We show that for every ribbon knot, there exists a tangle that satisfies two properties associated with the knot. First, under a specific closure, the closed tangle is equivalent to its corresponding knot. Second, under a different closure, the clos…

2017-05-29abs ↗pdf ↗

We define polynomial tangle invariants Ts\nabla_T^s via Kauffman states and Alexander codes and investigate some of their properties. In particular, we prove symmetry relations for Ts\nabla_T^s of 4-ended tangles and deduce that the multivariable Alexander polynomial is invariant under Conway mutation. The invariants $…

2016-01-19abs ↗pdf ↗

The paper addresses the kk-tangle enumeration problem. We introduce a notion of cascade diagram for kk-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

2007-12-22abs ↗pdf ↗

We compute the Kauffman bracket polynomial of the three-lead Turk's head, the chain sinnet and the figure-eight chain shadow diagrams. Each of these knots can in fact be constructed by repeatedly concatenating the same 3-tangle, respectively, then taking the closure. The bracket is then evaluated by expressing the stat…

2018-07-13abs ↗pdf ↗

The paper introduces a cobordism for Khovanov homology crossing change and categorifies Vassiliev skein relations.

problem Khovanov homology and crossing changes in tangle diagrams.
method Introducing a sum of cobordisms that yields a morphism on Khovanov homology complexes for crossing change.
result The introduced cobordism is invariant under double point moves and categorifies Vassiliev skein relations.

Extends tangle theory to include undetermined crossings in periodic structures.

problem Classical tangle theory's limitations in handling undetermined crossings.
method Introduces pseudo DP tangles, defined as liftings of pseudo motifs in the thickened torus, and analyzes them through diagrammatic methods.
result Defines equivalence for pseudo DP tangles and proves an analogue of Reidemeister theorem.

This paper tabulates prime knot projections up to eight double points.

problem Tabulating prime knot projections and their mirror images up to a certain number of double points.
method Systematic flypes and enumeration of tangles with at most four double points, using arrow diagrams.
result Complete table of prime knot projections with their mirror images up to eight double points.

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove theorems characterizing when the numerator of the sum of two rational tangles is…

2006-01-22abs ↗pdf ↗

We show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link and tangle theory can be expected to have a variety of applications, including o…

2012-10-24abs ↗pdf ↗

We show that under certain conditions the flyping operation on rational tangles, which produces topologically isotopic tangles, may also produce tangles which are not Legendrian isotopic when viewed in the standard contact structure on R3\mathbb{R}^3. This work is motivated by questions posed by Traynor, and incorporat…

2014-11-12abs ↗pdf ↗

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence classes of tangle machines, which are called invariants. This paper constructs …

2014-04-10abs ↗pdf ↗

We extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves corresponds to axioms of Loday's diassociative algebra. The relation of tangles to dias…

2010-10-31abs ↗pdf ↗

We show that the volume of any Montesinos link can be bounded above and below in terms of the combinatorics of its diagram. This was known for Montesinos links with at most two tangles, and those with at least five tangles. We complete the result for the remaining cases.

2015-02-27abs ↗pdf ↗

Study shows that splitting links requires an arbitrarily large number of extra crossings.

problem The problem is to determine the minimum number of extra crossings needed to transform a diagram of a split link into a split diagram.
method The approach uses Reidemeister moves and the framework of bubble tangles, along with techniques from Riemannian geometry.
result There exist split links with diagrams requiring an arbitrarily large number of extra crossings.

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed their Jones polynomials by a divide-and-conquer method, and tested those with triv…

2016-06-21abs ↗pdf ↗

We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provid…

2015-07-10abs ↗pdf ↗

We adapt Thistlethwaite's alternating tangle decomposition of a knot diagram to identify the potential extreme terms in its bracket polynomial, and give a simple combinatorial calculation for their coefficients, based on the intersection graph of certain chord diagrams.

2000-12-12abs ↗pdf ↗

Decomposing knots and links into tangles is a useful technique for understanding their properties. The notion of prime tangles was introduced by Kirby and Lickorish in [3]; Lickorish proved [5] that by summing prime tangles one obtains a prime link. In a similar spirit, summing two prime alternating tangles will produc…

2019-06-15abs ↗pdf ↗

In this paper we extend the idea of bordered Floer homology to knots and links in S3S^3: Using a specific Heegaard diagram, we construct gluable combinatorial invariants of tangles in S3S^3, D3D^3 and I×S2I\times S^2. The special case of S3S^3 gives back a stabilized version of knot Floer homology.

2014-10-08abs ↗pdf ↗

In a previous paper, Vértesi and the first author used grid-like Heegaard diagrams to define tangle Floer homology, which associates to a tangle TT a differential graded bimodule CT~(T)\widetilde{\mathrm{CT}} (T). If LL is obtained by gluing together T1,,TmT_1, \dotsc, T_m, then the knot Floer homology $\hat{\mathrm{HFK}}(L)…

2016-11-13abs ↗pdf ↗

The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.

problem Computing the Kauffman bracket polynomial for complex knots.
method Recursive concatenation of a 4-tangle shadow, followed by a closure operation and polynomial computation.
result A method to compute the Kauffman bracket polynomial for knots formed from 4-tangle shadows.

The paper improves bounds on knot crossings and tabulates minimal diagrams.

problem Improving bounds on knot crossings and tabulating minimal diagrams.
method Analyzing triple-crossing and delta-crossing numbers, proving tangle existence, generating tables.
result Improved bounds on knot crossings and tabulated minimal diagrams for prime knots up to delta-crossing number 4.

Ribbon tangles are proper embeddings of tori and cylinders in the 44-ball~B4B^4, "bounding" 33-manifolds with only ribbon disks as singularities. We construct an Alexander invariant A\mathsf{A} of ribbon tangles equipped with a representation of the fundamental group of their exterior in a free abelian group GG. Th…

2016-02-19abs ↗pdf ↗

We discuss an action of the Grothendieck-Teichmüller proalgebraic group on the linear span of proalgebraic tangles, oriented tangles completed by a filtration of Vassiliev. The action yields a motivic structure on tangles. We derive distinguished properties of the action particularly on proalgebraic string links and on…

2014-05-19abs ↗pdf ↗

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…

2013-10-31abs ↗pdf ↗

We introduce the notion of rational links in the solid torus. We show that rational links in the solid torus are fully characterized by rational tangles, and hence by the continued fraction of the rational tangle. Furthermore, we generalize this by giving an infinite family of ambient isotopy invariants of colored diag…

2016-11-18abs ↗pdf ↗

There exists a simplified Bar-Natan Khovanov complex for open 2-braids. The Khovanov cohomology of a knot diagram made by gluing tangles of this type is therefore often amenable to calculation. We lift this idea to the level of the Lipshitz-Sarkar stable homotopy type and use it to make new computations. Similarly, the…

2015-06-25abs ↗pdf ↗

We introduce a matrix representation of a chord on a tangle which leads us to representing tangle chord diagrams as stacks of matrices that we call books. We show that band sum moves, Reidemeister moves as well as orientation changes are implemented on \widetilde{Z}_f - a framed link invariant constructed from the Kont…

2010-10-14abs ↗pdf ↗

A new knot invariant using tangle-valued 1-cocycles.

problem Creating a strong and calculable knot invariant.
method Constructing a non-trivial combinatorial 1-cocycle L\mathbb{L} that takes values in H0(Θ;Z)H_0(Θ;\mathbb{Z}) with the scan-property.
result The Alexander tree is an isotopy invariant of knots, demonstrating the non-invertibility of specific knots.

We define a category vTv\mathcal{T} of tangles diagrams drawn on surfaces with boundaries. On the one hand we show that there is a natural functor from the category of virtual tangles to vTv\mathcal{T} which induces an equivalence of categories. On the other hand, we show that vTv\mathcal{T} is universal among ribbon c…

2016-02-09abs ↗pdf ↗