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

118236354472 · Jun 202019922001200920172026
48 results for complex knots

We construct families of trivial 22-knots KiK_i in R4\mathbb{R}^4 such that the maximal complexity of 22-knots in any isotopy connecting KiK_i with the standard unknot grows faster than a tower of exponentials of any fixed height of the complexity of KiK_i. Here we can either construct KiK_i as smooth embeddings and …

2015-10-09abs ↗pdf ↗

We show that the genus problem for alternating knots with nn crossings has linear time complexity and is in Logspace(n)(n). Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We show that the genus problem for these knots belongs to TC0TC^0 circuit complexity c…

2018-03-13abs ↗pdf ↗

In "Width complexes for knots and 3-manifolds," Jennifer Schultens defines the width complex for a knot in order to understand the different positions a knot can occupy in the 3-sphere and the isotopies between these positions. She poses several questions about these width complexes; in particular, she asks whether the…

2010-08-30abs ↗pdf ↗

The paper proves a linear diameter bound for hyperbolic knot complexes.

problem Understanding the diameter of Kakimizu complexes for hyperbolic knots.
method Defined a complex IS(K)IS_\ell(K) to study incompressible Seifert surfaces and proved its diameter has a linear upper bound.
result The diameter of the Kakimizu complex for hyperbolic knots grows linearly with genus, confirming a conjecture.

This paper computes Kakimizu complexes for all 11 crossing prime alternating knots.

problem Computing Kakimizu complexes for prime, alternating knots with 11 crossings.
method Used known algorithms and Murasugi sums with sutured manifold theory.
result Explicitly described Kakimizu complexes for all 11 crossing prime alternating knots.

The paper determines the structure of Kakimizu complexes for genus one hyperbolic knots.

problem Understanding the structure of Kakimizu complexes for genus one hyperbolic knots.
method Analyzing the simplicial complex of minimal genus Seifert surfaces in the exterior of the knots.
result The Kakimizu complex for genus one hyperbolic knots consists of a single dd-simplex for d=0,4d=0,4 and otherwise of at most two dd-simplices which intersect in a common (d1)(d-1)-face.

We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class NPco-NP{\sf NP} \cap {\sf co\text{-}NP}, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in NP{\sf NP} under the same assumption, and t…

2017-06-14abs ↗pdf ↗

New Garside structures found for torus knot groups and related braid groups.

problem Finding Garside structures for torus knot groups and related braid groups.
method Introducing a new Garside monoid M(n,m)\mathcal{M}(n,m) for (n,m)(n,m)-torus knot groups and other braid groups.
result New Garside structures for (n,m)(n,m)-torus knot groups and related braid groups are constructed.

Knots can be constructed and decomposed using Murasugi sums of Seifert surfaces.

problem Understanding the structure of knots through Murasugi sums.
method Using Murasugi sums to decompose and construct knots, showing the structure of a bi-directed complete graph.
result Any knot can be a Murasugi sum of any two knots, with bounds on minimal complexity.

We modify an approach of Johnson to define the distance of a bridge splitting of a knot in a 3-manifold using the dual curve complex and pants complex of the bridge surface. This distance can be used to determine a complexity, which becomes constant after a sufficient number of stabilizations and perturbations, yieldin…

2011-10-13abs ↗pdf ↗

New estimate of semimeander complexity for knots with more than 10 crossings.

problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.311.558cr(K)0.31 \cdot 1.558^{\operatorname{cr}(K)} crossings.

The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.

2008-05-14abs ↗pdf ↗

We show that the Kakimizu complex of a knot may be locally infinite, answering a question of Przytycki--Schultens. We then prove that if a link LL only has connected Seifert surfaces and has a locally infinite Kakimizu complex then LL is a satellite of either a torus knot, a cable knot or a connected sum, with windin…

2010-10-19abs ↗pdf ↗