Study unlinking numbers of 10-crossing links using link invariants.
problem Investigate unlinking numbers of 10-crossing links.
method Use various link invariants and explore their behavior with crossing changes.
result Find the unlinking numbers of all but 2 of the 287 prime, non-split links with crossing number 10.
This paper describes a method for the automatic evaluation of the Links-Gould two-variable polynomial link invariant (LG) for any link, given only a braid presentation. This method is currently feasible for the evaluation of LG for links for which we have a braid presentation of string index at most 5. Data are present…
New invariant distinguishes all knots up to 10 crossings.
problem Classical knot invariants struggle with distinguishing all knots up to 10 crossings.
method Introducing a pair of integer polynomials associated with checkerboard planar graphs of minimal diagrams.
result The invariant distinguishes all knots up to 10 crossings.
Table of symmetric diagrams for knots up to 10 crossings.
problem Finding symmetric diagrams for strongly invertible knots.
method Compilation of symmetric diagrams for knots up to 10 crossings.
result Similarity of transversal diagrams to symmetric union diagrams for strongly invertible knots.
Simplified method to list 250 knots with up to 10 crossings.
problem Generating a list of knots with up to 10 crossings.
method Generating all planar knot diagrams, simplifying, grouping, reducing with moves, and using invariants.
result Proves there are exactly 250 knots with up to 10 crossings.
We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This leads us to introduce a free polynomial algebra of invariants of graphs whose ele…
The study proves all prime knots up to 10 crossings have superbridge index ≤ 5.
problem Determining the maximum superbridge index for prime knots up to 10 crossings.
method New upper bounds on stick numbers and equilateral stick numbers for specific knots, leading to conclusions about superbridge index.
result All prime knots through 10 crossings have a superbridge index ≤ 5.
Quantum polynomials are derived from a specific tribracket structure.
problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.
Formula for Alexander polynomials of simple-ribbon knots derived.
problem Determining Alexander polynomials for simple-ribbon knots.
method Introduced simple-ribbon fusions and used them to derive a formula for Alexander polynomials.
result Formula for Alexander polynomials of simple-ribbon knots derived.
Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at most 10 crossings, for which the unknotting number can be confirmed by using th…
In this paper we investigate the construction of state models for link invariants using representations of the braid group obtained from various gauge choices for a solution of the trigonometric Yang-Baxter equation. Our results show that it is possible to obtain invariants of regular isotopy (as defined by Kauffman) w…
The Links-Gould invariant of alternating links has log-concave coefficients.
problem Log-concavity of Links-Gould coefficients for alternating links.
method Experimental and computational evidence.
result The Links-Gould coefficients of alternating links are log-concave.
It is known that the first two-variable Links--Gould quantum link invariant LG≡LG2,1 is more powerful than the HOMFLYPT and Kauffman polynomials, in that it distinguishes all prime knots (including reflections) of up to 10 crossings. Here we report investigations which greatly expand the set of evaluations o…
This paper calculates the non-orientable 4-genus for knots with 10 crossings.
problem Determining the non-orientable 4-genus for knots with a specific number of crossings.
method Calculating the minimal first Betti number of non-orientable surfaces smoothly embedded in a 4-ball with boundary the knot.
result The non-orientable 4-genus for knots with 10 crossings has been calculated.
The paper calculates Racah matrices for up to 3 strands of knots and links.
problem Systematic description of colored knot and link invariants.
method Highest weight method and use of Racah matrices.
result Explicit answers for Racah matrices and colored polynomials for 3-strand knots and links.
Study shows most knots up to 10 crossings can't be chirally cosmetic.
problem Identifying knots that can undergo chirally cosmetic surgeries.
method Used invariants from 3-manifold theory, including quantum SO(3)-invariant and Heegaard Floer homology.
result Approximately 75% of knots up to 10 crossings do not admit chirally cosmetic surgeries.
fkcompute calculates a knot invariant from a braid presentation.
problem Computing the Gukov-Manolescu invariant for complex knots and links.
method Three-phase pipeline: braid presentation search, state space encoding, R-matrix multiplication.
result fkcompute efficiently computes the invariant for knots and links up to 12 crossings.
New formulas connect knot invariants with theta functions.
problem Proving conjectures about knot invariants and 3-manifold invariants.
method Inverted state sums and Habiro series.
result Discovered formulas relating knot invariants to theta functions.
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…
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.31⋅1.558cr(K) crossings. Exact stick number of two knots with 10 crossings found.
problem Determining the stick number of specific knots.
method Analyzing specific knots 13n592 and 15n41,127 to find their stick number. result First non-torus prime knots with more than 9 crossings have stick number 10.
In knot concordance three genera arise naturally, g(K), g_4(K), and g_c(K): these are the classical genus, the 4-ball genus, and the concordance genus, defined to be the minimum genus among all knots concordant to K. Clearly 0 <= g_4(K) <= g_c(K) <= g(K). Casson and Nakanishi gave examples to show that g_4(K) need not …
Constructs six-dimensional braid group representations for knot detection.
problem Detecting braid vertibility of knots and links.
method Constructs six-dimensional block representations of B3 and uses them to detect braid vertibility. result Some representations can detect braid vertibility of known knots and links.
We show that for genus one knots the Alexander polynomial and the homology of the double cover branching over the knot provide obstructions to cosmetic crossings. As an application we prove the nugatory crossing conjecture for the negatively twisted, positive Whitehead doubles of all knots. We also verify the conjectur…
Lower bounds on Gordian distance using Blanchfield pairings.
problem Calculating the Gordian distance between knots.
method Using Blanchfield pairings to establish lower bounds.
result At least 195 pairs of knots have a Gordian distance of 3.
Python tool calculates cobordism maps in Khovanov homology.
problem Computing cobordism maps on Khovanov homology.
method Developed a Python module to calculate these maps.
result Computed cobordism maps for all incompressible Seifert surfaces of prime knots up to 10 crossings.
We present a class of knots associated with labelled generic immersions of intervals into the plane and compute their Gordian numbers and 4-dimensional invariants. At least 10% of the knots in Rolfsen's table belong to this class of knots. We call them track knots. They are contained in the class of quasipositive knots…
Ozsvath and Szabo have defined a knot concordance invariant tau that bounds the 4-ball genus of a knot. Here we discuss shortcuts to its computation. We include examples of Alexander polynomial one knots for which the invariant is nontrivial, including all iterated untwisted positive doubles of knots with nonnegative T…
Involutive bordered Floer homology computes 3-manifold invariants.
problem Computing involutive Heegaard Floer homology for 3-manifolds.
method Bordering technique to extend involutive HF-hat, algorithmic approach, mapping class group action computation.
result Involutive HF-hat satisfies a surgery exact triangle, computed for many knots.
We show that two Dehn surgeries on a knot K never yield manifolds that are homeomorphic as oriented manifolds if VK′′(1)=0 or VK′′′(1)=0. As an application, we verify the cosmetic surgery conjecture for all knots with no more than 11 crossings except for three 10-crossing knots and five 11-crossin…
Improved bounds on stick numbers of knots up to 13 crossings.
problem Finding better bounds on the stick number of knots.
method Simulated annealing with knot-type preserving moves.
result Comprehensive table of stick number bounds on all knots through 13 crossings.
New tangles found for 21 ribbon knots with 10 or fewer crossings.
problem Characterizing ribbon knots through tangle forms.
method For each of 21 ribbon knots, found a 4-strand tangle that satisfies specific closure properties.
result Each of 21 ribbon knots can be represented by a tangle that meets the specified closure conditions.
New upper bounds on superbridge index for 49 knots, increasing known results to 49.
problem Determining superbridge index for knots not covered by stick number.
method New upper bounds not derived from stick number.
result Superbridge index of 4 for 49 knots, increasing known results to 49.
We analyze relations between BPS degeneracies related to Labastida-Marino-Ooguri-Vafa (LMOV) invariants, and algebraic curves associated to knots. We introduce a new class of such curves that we call extremal A-polynomials, discuss their special properties, and determine exact and asymptotic formulas for the correspond…
An equilateral stick number s=(K) of a knot K is defined to be the minimal number of sticks required to construct a polygonal knot of K which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the equilateral stick numbers of all prime knots through 10 crossings by using algorithm…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 1…
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result (i.e. that a knot is the unknot), whilst simultaneously using a model finder to try …
Study shows space writhe closely correlates with knot signature in polymers.
problem Understanding the relationship between space writhe and knot signatures in knotted polymers.
method Performed Langevin dynamics simulations of knotted polymers to measure space writhe.
result Space writhe is strongly correlated with knot signature in complex knots.
The paper defines and calculates an upper bound for the equivariant crossing number of two-bridge knots.
problem Finding the minimum number of crossings in symmetric diagrams for two-bridge knots.
method Defining and calculating c2(K) for two-bridge knots by restricting diagrams to two types. result An algorithm to determine c2(K) for any two-bridge knot and results up to 14 crossings. New superbridge index calculations for knots with odd edges.
problem Computing superbridge index of knots.
method Polygonal realizations with odd edges and linear programming.
result Exact superbridge index of many new knots, including 9- and 12-crossing knots.
New bounds on stick number of knots found using random polygon generation.
problem Understanding the minimum number of segments needed to build a polygonal knot.
method Monte Carlo approach to generating and analyzing large ensembles of random polygons.
result Improved bounds on stick number for over 40% of knots with 10 or fewer crossings.
Paper calculates Racah matrices for 3-strand knots, validating conjectures.
problem Systematic description of colored knot polynomials.
method Highest weight method with Gelfand-Tseitlin tables.
result Explicit Racah matrices and polynomials for 3-strand knots up to 10 crossings.
Positive surgery on knots in weakly fillable 3-manifolds yields weakly fillable contact structures.
problem Conditions for a knot to admit a fillable positive surgery.
method Contact surgery, symplectic embeddings, and quasipositive knots.
result Conditions for a knot to admit a fillable positive surgery, including quasipositivity and slice genus equality.
The paper calculates actions of string link operations for 4- and 5-component links.
problem Classifying link-homotopy classes of string links.
method Explicit calculation of actions of partial conjugations and conjugations for 4- and 5-component string links.
result Presentations of link-homotopy classes for 4- and 5-component links.
Study proves chainmail links are L-space links.
problem Understanding L-space links in chainmail links.
method Inspired by alternating links, uses flat augmentation.
result Proves alternating chainmail links are L-space links.
New findings on T-links derived from torus links.
problem Difficulty in determining geometric type of T-links.
method Examined T-links obtained by full twists along torus links.
result T-links obtained by full twists are not torus links.
Paper discusses when virtual links are equivalent as twisted links.
problem Determining equivalence of virtual links as twisted links.
method Using stable equivalence classes of links in oriented thickenings of surfaces.
result Necessary and sufficient condition for virtual links to be equivalent as twisted links.
Abstract lists known link diagrams for all principal congruence link complements.
problem Identifying all known link diagrams for principal congruence link complements.
method Compilation of known link diagrams.
result Compilation of known link diagrams for principal congruence link complements.