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

Trend · papers per month

36912 · Oct 201919922001200920172026
48 results for bottom tangles

A bottom tangle is a tangle in a cube consisting of arc components whose boundary points are on a line in the bottom square of the cube. A ribbon bottom tangle is a bottom tangle whose closure is a ribbon link. For every n-component ribbon bottom tangle T, we prove that the universal invariant J_T of T associated to th…

2009-05-12abs ↗pdf ↗

A bottom tangle is a tangle in a cube consisting only of arc components, each of which has the two endpoints on the bottom line of the cube, placed next to each other. We introduce a subcategory B of the category of framed, oriented tangles, which acts on the set of bottom tangles. We give a finite set of generators of…

2005-05-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 ↗

The universal sl_2 invariant of bottom tangles has a universality property for the colored Jones polynomial of links. Habiro conjectured that the universal sl_2 invariant of boundary bottom tangles takes values in certain subalgebras of the completed tensor powers of the quantized enveloping algebra U_h(sl_2) of the Li…

2011-03-11abs ↗pdf ↗

Quantum theory constructs a group and skein module for knot complements.

problem Understanding the fundamental group of knot complements using quantum methods.
method Using bottom tangles, the universal space of quantum representations is constructed, then factored by the skein relation to get the skein module.
result Derives recurrence relation for the colored Jones polynomial, known as AqA_q polynomial.

Given a clover link, we construct a bottom tangle by using a disk/band surface of the clover link. Since the Milnor number is already defined for a bottom tangle, we define the Milnor number for the clover link to be the Milnor number for the bottom tangle and show that for a clover link, if Milnor numbers of length k …

2015-06-12abs ↗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.

Using an extension of the Kontsevich integral to tangles in handlebodies similar to a construction given by Andersen, Mattes and Reshetikhin, we construct a functor Z:BA^Z:\mathcal{B}\to \widehat{\mathbb{A}}, where B\mathcal{B} is the category of bottom tangles in handlebodies and A^\widehat{\mathbb{A}} is the degree-com…

2017-02-02abs ↗pdf ↗

Suppose KK is a hyperbolic knot in a solid torus VV intersecting a meridian disk DD twice. We will show that if KK is not the Whitehead knot and the frontier of a regular neighborhood of KDK \cup D is incompressible in the knot exterior, then KK admits at most one exceptional surgery, which must be toroidal. Embed…

2011-05-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 ↗

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 ↗

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 ↗

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.

Bottom-up algorithms outperform top-down in hierarchical community detection at intermediate levels.

problem Finding the optimal hierarchical community structure in networks.
method A bottom-up algorithm for hierarchical clustering of networks.
result Bottom-up algorithms achieve the information-theoretic threshold for exact recovery at intermediate levels of the hierarchy.

The paper examines when 2-string tangles can be embedded into specific link types.

problem When 2-string tangles can be embedded into the unknot, unlink, or split links.
method Geometric characterizations, tangle sums, and colorings.
result Prime 2-string tangles with up to seven crossings are classified for embedding into specific link types.

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 ↗

Study tangle equations linking enzyme actions to knot theory.

problem Proving the Jones Unknot conjecture and understanding tangle solutions.
method Analyzing framed tangle equations and introducing Kauffman bracket ratios.
result Unique rational solutions for tangle equations imply the Jones Unknot conjecture.