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.

169,291 papers · 148 categories

Trend · papers per month

2.1%4.2%6.3%8.3% · Oct 199519922001200920182026
48 results for Legendrian tangles

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 ↗

We study Legendrian singular links up to contact isotopy. Using a special property of the singular points, we define the singular connected sum of Legendrian singular links. This concept is a generalization of the connected sum and can be interpreted as a tangle replacement, which provides a way to classify Legendrian …

2015-03-03abs ↗pdf ↗

Given a front projection of a Legendrian knot KK in R3\mathbb{R}^{3} which has been cut into several pieces along vertical lines, we assign a differential graded algebra to each piece and prove a van Kampen theorem describing the Chekanov-Eliashberg invariant of KK as a pushout of these algebras. We then use this the…

2010-04-28abs ↗pdf ↗

Examples are given of prime Legendrian knots in the standard contact 3-space that have arbitrarily many distinct Chekanov polynomials, refuting a conjecture of Lenny Ng. These are constructed using a new `Legendrian tangle replacement' technique. This technique is then used to show that the phenomenon of multiple Cheka…

2004-11-09abs ↗pdf ↗

Differential graded algebra invariants are constructed for Legendrian links in the 1-jet space of the circle. In parallel to the theory for R^3, Poincare-Chekanov polynomials and characteristic algebras can be associated to such links. The theory is applied to distinguish various knots, as well as links that are closur…

2004-07-05abs ↗pdf ↗

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof defines the tangle fraction from the canonical form and uses flyping to prove in…

2003-11-27abs ↗pdf ↗

We show that for a tangle TT with 0T1T-\partial^0T \cong \partial^1 T the Hochschild homology of the tangle Floer homology CT~(T)\widetilde{\mathit{CT}}(T) is equivalent to the link Floer homology of the closure T=T/(0T1T)T' = T/(-\partial^0T \sim \partial^1 T) of the tangle, linked with the tangle axis. In addition, we show that t…

2015-03-22abs ↗pdf ↗

Decomposes prime alternating links into prime tangles.

problem Understanding how to decompose prime alternating links into prime tangles.
method Refined results from Menasco and Thistlethwaite, focusing on alternating property and pseudo-Montesinos links.
result If a prime alternating link can be decomposed into two prime tangles, it must be visible in an alternating link diagram or the link is pseudo-Montesinos.

In this paper, We introduce an invariant of rational n-tangles which is obtained from the Kauffman bracket. It forms a vector with Laurent polynomial entries. We prove that the invariant classifies the rational 2-tangles and the reduced alternating rational 3-tangles. We conjecture that it classifies the rational 3-tan…

2014-01-28abs ↗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 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 ↗

A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the category of oriented tangles to the category of Z[t,t^{-1}]-modules. For (1,1)-tangl…

2012-03-20abs ↗pdf ↗

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines motivated by the problem of describing `covariance intersection' fusion of Gaussian estimators in networks. It then gives two examples in which ta…

2015-11-16abs ↗pdf ↗

We generalize our previous work on categorification of Kauffman bracket skein module of surfaces, by extending our homology to tangles in cylinders over surfaces, F x [0,1]. Our homology of 0-tangles and 1-tangles in D^3 coincides (up to normalization) with Khovanov link homology and the reduced Khovanov link homology.…

2004-10-09abs ↗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.

The study finds non-simple isotopy classes of links in 3-manifolds, including Legendrian and pseudo-Legendrian examples.

problem Characterizing isotopy classes of links in 3-manifolds, especially in contact structures.
method Developed theory of links transverse to a nowhere-zero vector field, constructing examples in both Legendrian and pseudo-Legendrian settings.
result Non-simple isotopy classes of links exist, including Legendrian and pseudo-Legendrian examples.