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,694 papers · 148 categories

Trend · papers per month

13263952 · Jun 202019922001200920172026
48 results for trivial tangle

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 ↗

A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power of U_h(sl_2) in which the universal sl_2 invariant of n-component Brunnian bottom…

2011-11-27abs ↗pdf ↗

Given a compact oriented 3-manifold M in S^3 with boundary, an (M,2n)-tangle T is a 1-manifold with 2n boundary components properly embedded in M. We say that T embeds in a link L in S^3 if T can be completed to L by a 1-manifold with 2n boundary components exterior to M. The link L is called a closure of T. We define …

2013-09-18abs ↗pdf ↗

A persistent lamination for a knot K is an essential lamination in the complement of the K, which remains essential after every non-trivial Dehn surgery along K. In particular, this implies that all of the Dehn surgery manifolds have universal cover R^3. This paper presents a method for building tangles T with the prop…

1998-07-24abs ↗pdf ↗

A ravel is a spatial graph which is non-planar but contains no non-trivial knots or links. We characterize when a Montesinos tangle can become a ravel as the result of vertex closure with and without replacing some number of crossings by vertices.

2015-11-14abs ↗pdf ↗

Extended symmetric union with multiple tangle regions and Alexander polynomial properties.

problem Characterizing knots with multiple tangle regions.
method Generalizing the symmetric union construction to include multiple tangle regions and analyzing the Alexander polynomial.
result The Alexander polynomial of the constructed knot is the product of the Alexander polynomials of the tangles and the square of the partial knot's Alexander polynomial.

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 ↗

The central discovery of 2d2d conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire huge Hilbert space of states. Somewhat similar, when a link diagram is glued from t…

2018-04-19abs ↗pdf ↗

Study character varieties of tangles to map immersed curves in the pillowcase.

problem Characterizing holonomy-perturbed traceless SU(2) character varieties.
method Examining marked tangles as endomorphisms in the cobordism category and using holonomy-perturbed traceless character variety functor.
result Endomorphisms of immersed curves in the pillowcase have the same image.

This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the Jones polynomial.

2014-07-04abs ↗pdf ↗

First, we extend Otal's result for the trivial knot to trivial spatial graphs, namely, we show that for any bridge tangle decomposing sphere S2S^2 for a trivial spatial graph ΓΓ, there exists a 2-sphere FF such that FF contains ΓΓ and FF intersects S2S^2 in a single loop. Next, we introduce two invariants for spat…

2009-09-07abs ↗pdf ↗

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.

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 show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also discuss unavoidable sets of tangles for spherical curves.

2014-01-16abs ↗pdf ↗

We prove an excision theorem for the singular instanton Floer homology that allows the excision surfaces to intersect the singular locus. This is an extension of the non-singular excision theorem by Kronheimer and Mrowka and the genus-zero singular excision theorem by Street. We use the singular excision theorem to def…

2019-07-01abs ↗pdf ↗

The paper classifies virtual knot polynomials and trivalent graph invariants using skein theory.

problem Classifying virtual knot polynomials and trivalent graph invariants with specific conditions.
method Skein-theoretic techniques applied to classify invariants with smallness conditions.
result Classification of all non-trivial invariants of trivalent graphs and skein theories of virtual tangles.

The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the present paper is a generalization of Conway's mutation of knots and links. Instead of…

2004-05-20abs ↗pdf ↗

Study on string links invariant under associator choice and Grothendieck--Teichmüller group action.

problem Independence of Kontsevich invariant under associator choice for 2-component string links.
method Investigation of Kontsevich invariant for 2-component string links and action of Grothendieck--Teichmüller group.
result Non-trivial action of Grothendieck--Teichmüller group on algebra of 2-component string links.

New quantum models unify Alexander and generalized Alexander polynomials for AC links.

problem Defining and distinguishing AC links and virtual knots.
method Generalizing AC links to virtual tangles and using quantum supergroups.
result Generalized Alexander polynomials are distinct from Alexander polynomials for AC links.

Introducing a way to modify knots using nn-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and Yamada). The same result is shown for 4-genera and finite reductions of the homolog…

1999-09-09abs ↗pdf ↗

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 ↗

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for knotted trivalent graphs. Our method also yields invariants of, what we refer to as…

2018-06-17abs ↗pdf ↗

We create a framework for odd Khovanov homology in the spirit of Bar-Natan's construction for the ordinary Khovanov homology. Namely, we express the cube of resolutions of a link diagram as a diagram in a certain 2-category of chronological cobordisms and show that it is 2-commutative: the composition of 2-morphisms al…

2013-10-07abs ↗pdf ↗

We introduce a generalization of oriented tangles, which are still called tangles, so that they are in one-to-one correspondence with the sutured manifolds. We define cobordisms between sutured manifolds (tangles) by generalizing cobordisms between oriented tangles. For every commutative algebra A over Z/2Z, we define …

2016-10-23abs ↗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 ↗

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 ↗