English
Related papers

Related papers: A New Way to Tabulate Knots

200 papers

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.…

Geometric Topology · Mathematics 2007-05-23 Sebastian Baader

Let $T$ be a tree, a vertex of degree one is called a leaf. The set of leaves of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem of $T$ and denoted by $Stem(T).$ In this note, we give a sharp sufficient…

Combinatorics · Mathematics 2018-10-22 Pham Hoang Ha , Dang Dinh Hanh

Assume that \Gamma_{v_0} is a tree with vertex set Vert(\Gamma_{v_0})={v_0, v_1,..., v_n}, and with an integral framing (weight) attached to each vertex except v_0. Assume furthermore that the intersection matrix of G=\Gamma_{v_0}-{v_0} is…

Geometric Topology · Mathematics 2012-08-14 Peter Ozsváth , András Stipsicz , Zoltán Szabó

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

Geometric Topology · Mathematics 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

Geometric Topology · Mathematics 2019-09-16 Greg Kuperberg

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…

Geometric Topology · Mathematics 2016-11-26 Michael Brandenbursky

We define a knot to be half ribbon if it is the cross-section of a ribbon 2-knot, and observe that ribbon implies half ribbon implies slice. We introduce the half ribbon genus of a knot K, the minimum genus of a ribbon knotted surface of…

Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…

Algebraic Geometry · Mathematics 2025-12-02 Philip Boalch

We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states…

Geometric Topology · Mathematics 2018-05-18 Nicholas Owad

Grid diagrams are special representations of knots in the three-sphere that are used to define a combinatorial version of knot Floer homology. Paolo Ghiggini and Yi Ni showed that knot Floer homology detects fibered knots. Their results…

Geometric Topology · Mathematics 2026-02-04 Paul Leon Itzlinger

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…

Geometric Topology · Mathematics 2026-03-26 Yury Belousov

We explain the notion of a grope cobordism between two knots in a 3-manifold. Each grope cobordism has a type that can be described by a rooted unitrivalent tree. By filtering these trees in different ways, we show how the Goussarov-Habiro…

Geometric Topology · Mathematics 2010-08-25 Jim Conant , Peter Teichner

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…

Combinatorics · Mathematics 2012-06-15 Shuchao Li , Shujing Wang

Introducing a way to modify knots using $n$-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…

Geometric Topology · Mathematics 2007-05-23 A. Stoimenow

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

Algebraic Topology · Mathematics 2019-08-15 Adam Clay , Colin Desmarais , Patrick Naylor

We develop purely algebraic methods for proving that a knot is prime. Our approach uses the Heegaard Floer polynomial in conjunction with classical knot-theoretic methods: cyclic, dihedral, and metacyclic covering spaces. The theory of…

Geometric Topology · Mathematics 2025-08-12 Samantha Allen , Charles Livingston

We partially determine grid homology (combinatorial knot Floer homology) of diagonal knots, which are conjectured to be equivalent to positive braid knots, by exploiting nice grid diagrams. Its next-to-top term detects the number of prime…

Geometric Topology · Mathematics 2025-07-18 Hajime Kubota

Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…

Algebraic Geometry · Mathematics 2025-02-25 Indranil Biswas , Apratim Choudhury , Ritwik Mukherjee , Anantadulal Paul

We give an explicit construction of complex maps whose nodal line have the form of lemniscate knots. We review the properties of lemniscate knots, defined as closures of braids where all strands follow the same transverse (1, $\ell$)…

Geometric Topology · Mathematics 2017-07-05 Benjamin Bode , Mark R Dennis , David Foster , Robert P King

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

Discrete Mathematics · Computer Science 2016-02-02 Fabrizio Luccio