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

Trend · papers per month

71143214285 · Jun 202019922001200920172026
48 results for minimizing knots

We study knots in S3\mathbb{S}^3 obtained by the intersection of a minimal surface in R4\mathbb{R}^4 with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of non-fibered minimal knots. We show that simple minimal knots are either reversible or …

2007-02-09abs ↗pdf ↗

A knot is called minimal if its knot group admits epimorphisms onto the knot groups of only the trivial knot and itself. In this paper, we determine which two-bridge knot b(p,q)\mathfrak{b}(p,q) is minimal where q6q \leq 6 or p100p \leq 100.

2016-09-08abs ↗pdf ↗

Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we consider every knot in the cubic lattice. Especially the minimal length of a kno…

2014-11-07abs ↗pdf ↗

Prove strong ribbon concordance induces a partial order on links, certify minimality for a handful of knots, and find minimal ribbon minimal knots.

problem Prove strong ribbon concordance induces a partial order on links.
method Use results from knot Floer homology to certify minimality under the ribbon partial order.
result Certify minimality for a handful of knots and find minimal ribbon minimal knots.

A partial order on the set of prime knots can be defined by the existence of an epimorphism between knot groups. We prove that all the prime knots with up to 66 crossings are minimal. We also show that each fibered knot with the irreducible Alexander polynomial is minimal.

2014-12-10abs ↗pdf ↗

Minimal grid diagrams found for 13-crossing prime knots.

problem Finding the simplest grid diagrams for prime knots with 13 crossings.
method Converted prime alternating knots to grid diagrams, focusing on minimal configurations.
result 4878 prime alternating knots with 13 crossings have been represented by grid diagrams with 15 vertical segments.

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that is irreducibly odd, then it is minimal with respect to the number of classical …

2010-08-18abs ↗pdf ↗

This paper determines the minimal degree sequence for two compact rational knots, namely the trefoil and figure-eight knots. We find explicit projections with the minimal degree sequence of each knot. This is done by modifying a non-compact rational minimal-degree parameterization of the trefoil and figure-eight knots …

2011-11-14abs ↗pdf ↗

If a knot has the Alexander polynomial not equal to 1, then it is linear nn-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot is quandle colorable. For twist knots, we study the minimal quandle orders in d…

2011-10-18abs ↗pdf ↗

Roberts proved that a family of alternating, arborescent, prime knots each have at least 22n12^{2n-1} distinct minimal genus Seifert surfaces, where nn is the genus of the knot in question. We give a subfamily of these knots that have exactly this many minimal genus Seifert surfaces.

2013-08-14abs ↗pdf ↗

We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots have bridge index three.

2012-08-21abs ↗pdf ↗

Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.

problem Representing prime knots with 14 crossings and specific arc indices using grid diagrams.
method Enumerated all prime knots with 14 crossings, categorized by arc index, and found minimal grid diagrams for those with arc index 14.
result 8,027 knots with arc index 13 and 15,735 knots with arc index 14 were represented by minimal grid diagrams.

Study ribbon concordance and minimal compressions, proving new results about fibered knots.

problem Understanding ribbon concordance and minimal compressions of surface homeomorphisms.
method Proving monotonicity of simplicial volume and dilatation under ribbon concordance, algorithmic enumeration of minimal compressions.
result Every fibered knot has only finitely many predecessors in the ribbon-concordance partial order.

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is strictly less than the minimal crossing number. We also give minimal grid diagrams o…

2011-06-13abs ↗pdf ↗

Minimal grid diagrams found for 13-crossing prime knots with 13 arc index.

problem Finding minimal grid diagrams for prime knots with specific crossing and arc indices.
method Used Knotscape to generate spanning trees and obtain minimal arc presentations in grid diagrams.
result 9,988 prime knots with 13 crossings and 13 arc index were identified.

New algorithm constructs characters of rational VOAs from knot complements.

problem Constructing characters of rational VOAs from knot complements.
method 3D N=2\mathcal{N}=2 gauge theories, Dimofte-Gaiotto-Gukov construction, 3D N=4\mathcal{N}=4 rank-0 SCFT, topological twist.
result New Nahm-sum-like expressions for Virasoro minimal model characters.

Enumerates knots up to five crossings and describes moves between them.

problem Counting and classifying knots up to a specific number of crossings.
method Generated tables of minimal diagrams and derived moves between knots.
result Conjecture about a lower bound for the triple-crossing number based on Alexander polynomial.

Study essential diagrams of knots in SgimesS1S_{g} imes S^{1} and their relation to virtual knots.

problem Understanding essential diagrams and their relation to virtual knots in SgimesS1S_{g} imes S^{1}.
method Analyzing knots with minimal double lines and embedding virtual knot theory.
result Virtual knot theory is embedded in the theory of knots in SgimesS1S_{g} imes S^{1}.

We show that any non-minimal bridge decomposition of a torus knot is stabilized and that nn-bridge decompositions of a torus knot are unique for any integer nn. This implies that a knot in a bridge position is a torus knot if and only if there exists a torus containing the knot such that it intersects the bridge sphe…

2010-06-05abs ↗pdf ↗

A minimal knot is the intersection of a topologically embedded branched minimal disk in R4\mathbb{R}^4 C2\mathbb{C}^2 with a small sphere centered at the branch point. When the lowest order terms in each coordinate component of the embedding of the disk in C2\mathbb{C}^2 are enough to determine the knot type, we talk …

2012-12-11abs ↗pdf ↗

Given a one-dimensional homology class in a lens space, a question related to the Berge conjecture on lens space surgeries is to determine all knots realizing the minimal rational genus of all knots in this homology class. It is known that simple knots are rational genus minimizers. In this paper, we construct many non…

2013-05-02abs ↗pdf ↗

The warping sum e(K)e(K) of a knot KK is the minimal value of the sum of the warping degrees of a minimal diagram of KK with both orientations. In this paper, knots KK with e(K)3e(K) \le 3 are characterized, and some knots KK with e(K)=4e(K)=4 are given.

2017-12-20abs ↗pdf ↗

Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.

problem Understanding minimal crossings of knot diagrams on a punctured sphere.
method Mathematical model of string figures using knot diagrams on xyzxyz-space with missing vertical lines, analyzing minimal crossings under Reidemeister moves.
result Minimal number of crossings of knot diagrams on a punctured sphere.

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.

We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately minimize the ropelength (or quotient of length and thickness) for polygons in their kno…

2010-02-08abs ↗pdf ↗

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms and knots.

2005-01-28abs ↗pdf ↗

Minimal triangulations for 229 hyperbolic census knots discovered.

problem Finding minimal triangulations for hyperbolic census knots.
method Ideal triangulations of the magic manifold, low-complexity triangulations for partial fillings, sorting into families.
result Minimal triangulations for 229 hyperbolic census knots discovered, conjectured to be minimal for all 42 families.