Study on folded ribbon knots and their minimum length.
problem Finding the minimum length of folded ribbon knots.
method Using Kauffman's model of folded ribbon knots and analyzing their properties.
result Proved bounds on the minimum folded ribbonlength for various types of knots.
This paper gives mathematical models for flat knotted ribbons, and makes specific conjectures for the least length of ribbon (for a given width) needed to tie the trefoil knot and the figure eight knot. The first conjecture states that (for width one) the least length of ribbon needed to tie an open-ended trefoil knot …
Study minimum ribbonlength of immersed flat knots and links.
problem Finding the minimum ribbonlength for immersed planar knots and links.
method Embedding into disk diagram space to find length minimizers.
result Computed minimal ribbonlength for some knot and link diagrams.
Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat and folded. An important problem in knot theory is to study the minimal ratio of …
The paper calculates minimal ribbonlength for various knots.
problem Tabulation of knots based on energy criterion.
method Direct method for computing minimal ribbonlength.
result Computed minimal ribbonlength for specific knots.
Paper proves ribbonlength grows linearly with knot complexity.
problem Proving ribbonlength grows linearly with knot complexity.
method Binary grid diagrams and bisected vertex leveling techniques.
result Ribbonlength is bounded by a linear function of the crossing number.
This paper confirms a bound for folded ribbonlength of 2-bridge knots.
problem Bounding the folded ribbonlength of 2-bridge knots.
method Investigated the folded ribbonlength of 2-bridge knots and proved a linear upper bound.
result The folded ribbonlength of a 2-bridge knot K is bounded above by 2c(K)+2. We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a ribbon, and it turns out that the way the ribbon is folded influences the ribbonlength. We give an upper bound of ncot(π/n) for the ribbonlength of $…
Study on ribbonlength and crossing number for folded ribbon knots.
problem Understanding the relationship between ribbonlength and crossing number for folded ribbon knots.
method Used two different methods to establish upper bounds on ribbonlength in terms of crossing number.
result Found constants c1 and c2 such that ribbonlength is bounded above by c1⋅Cr(K)2 and c2⋅Cr(K)3/2, respectively. Random subsurfaces of hyperbolic surfaces equidistribute to ribbon graphs.
problem Distribution of shapes of complementary subsurfaces in moduli space.
method Study of shapes of complementary subsurfaces in moduli space as boundary lengths go to infinity.
result Random subsurfaces look like random ribbon graphs.
A criterion is given for cutting out disks with ribbons from a Möbius strip.
problem Determining which hieroglyphs can be realized as disks with ribbons on a Möbius strip.
method Developed a criterion based on Mohar's realizability criterion, leading to a quadratic algorithm.
result A criterion for weak realizability of disks with ribbons on a Möbius strip.
This survey reviews Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a ribbon, and the ribbonlength problem asks to minimize the ribbonlength for a given knot type. We give a summary of known results. For the mos…
Study of lengths of cycles in large genus random maps converging to Poisson process.
problem Understanding the distribution of cycle lengths in large genus random maps.
method Teichmüller theory approach for uniformly random metric maps (ribbon graphs).
result The length spectrum converges to a Poisson point process with an explicit intensity as genus tends to infinity.
Study on the ribbonlength of knots and links, improving upper bounds.
problem Finding the infimal folded ribbonlength of knots and links.
method Creating new folded ribbon knots and applying them to improve upper bounds.
result Improved upper bounds for (2,q)-torus links, twist knots, and pretzel links. Upper bounds on ribbonlength of various knots, showing linear and sub-linear behavior.
problem Estimating the ribbonlength of different types of knots.
method Using Kauffman's model of folded ribbon knots, we derive upper bounds on ribbonlength for specific knot types.
result Upper bounds on ribbonlength are linear in crossing number for some knots and sub-linear for others.
This paper finds bounds on the ribbonlength of knots and links with up to 9 crossings.
problem Finding the infimal folded ribbonlength of knots and links.
method Analyzing pretzel links and constructing knots to find bounds on ribbonlength.
result Uniform bounds on infimal folded ribbonlength for certain link families.
Using Kauffman's model of flat knotted ribbons, we demonstrate how all regular polygons of at least seven sides can be realised by ribbon constructions of torus knots. We calculate length to width ratios for these constructions thereby bounding the Ribbonlength of the knots. In particular, we give evidence that the clo…
Critical graphs of quadratic differentials equidistribute in moduli space.
problem Distribution of critical graphs in moduli space.
method Study of Jenkins-Strebel differentials and their critical graphs.
result Critical graphs equidistribute to the Kontsevich measure.
This article introduces planar ribbons, Vergili ribbon complexes and ribbon nerves in Alexandroff-Hopf-Whitehead CW (Closure finite Weak) topological spaces. A {\em planar ribbon} (briefly, {ribbon}) in a CW space is the closure of a pair of nesting, non-concentric filled cycles that includes the boundary but does not …
In a previous paper, we introduced special types of fusions, so called simple-ribbon fusions on links. A knot obtained from the trivial knot by a finite sequence of simple-ribbon fusions is called a simple-ribbon knot. Every ribbon knot with <10 crossings is a simple-ribbon knot. In this paper, we give a formula for th…
It is shown that any handle-irreducible summand of every stable-ribbon surface-link is a unique ribbon surface-link up to equivalences, so that every stable-ribbon surface-link is a ribbon surface-link. This is a generalization of a previously observed result for a stably trivial surface-link. Two observations are give…
New bounds found for ribbon numbers of knots and links.
problem Finding bounds for the ribbon number of knots and links.
method Using determinant and Jones polynomial, we find new lower bounds and prove the finiteness of certain sets.
result We determine the set of Jones polynomials for ribbon knots with 11 or fewer crossings.
We study the ribbon discs that arise from a symmetric union presentation of a ribbon knot. A natural notion of symmetric ribbon number is introduced and compared with the classical ribbon number. We show that the gap between these numbers can be arbitrarily large by constructing an infinite family of ribbon knots with …
In this paper, we analyze the Bollobás and Riordan polynomial R for ribbon graphs with half-ribbons introduced in [Combinatorics, Probability and Computing 31, 507-549, 2022]. We prove the universality property of a multivariate version of R whereas R itself turns out to be universal…
Author provides an alternate proof of the free ribbon lemma.
problem Proving that every free sphere-link in the 4-sphere is a ribbon sphere-link.
method An alternate proof of the free ribbon lemma.
result Provides an alternate proof of the free ribbon lemma.
Extends Heisenberg homology to ribbon graphs.
problem Configurations in bounded surfaces.
method Regular thickening of ribbon graphs.
result Heisenberg homology applied to ribbon graphs.
New knots bound multiple non-isotopic ribbon disks.
problem Finding knots that bound multiple non-isotopic ribbon disks.
method Classification of fibered, homotopy-ribbon disks for generalized square knots.
result Infinitely many knots bound infinitely many pairwise non-isotopic ribbon disks.
The paper calculates ribbon numbers for 12-crossing knots using Alexander polynomials.
problem Determining the minimum number of ribbon singularities for knots.
method Using Alexander polynomials and systematic treatment of knot invariants.
result Computed ribbon numbers for many 12-crossing knots.
Study Alexander polynomials of ribbon and virtual knots using ribbon's intrinsic singularity.
problem Determining Alexander polynomials for ribbon and virtual knots.
method Using ribbon's intrinsic singularity information, defining half Alexander polynomial, and developing simplified formulas.
result New formulas for Alexander polynomials of general knots and virtual knots in terms of Gauss diagrams.
Study knots that divide ribbon knotted surfaces, computing their half ribbon genus and fusion number.
problem Understanding knots that divide ribbon knotted surfaces and their properties.
method Defining half ribbon knots, computing half ribbon genus and fusion number, and comparing with Levine-Tristram signatures.
result Computed half ribbon genus and fusion number for various knots, including new computations of doubly slice genus.
Ribbon cobordism forms a partial order in 3-manifolds.
problem Understanding partial orders in 3-manifolds.
method Utilizing recent methods from Ian Agol's work on knot concordance.
result Ribbon rational homology cobordism forms a partial order.
New concept of quasi-ribbon surface-links simplifies complex surface-links.
problem Complexity in surface-links of trivial components.
method Introducing quasi-ribbon surface-links as a generalization of ribbon surface-links.
result Every F-link of trivial components on a surface F with at most one aspheric component is a quasi-ribbon surface-link.
Paper studies metric ribbon graphs and provides a recursion for their volumes.
problem Calculating volumes of combinatorial moduli spaces of directed metric ribbon graphs.
method Decomposes directed ribbon graphs into simpler graphs with one vertex, proving a canonical recursion scheme for volumes.
result Explicit recursion for volumes of four-valent metric ribbon graphs provided.
Study shows not all ribbon knots can be symmetric unions.
problem Whether every ribbon knot can be a symmetric union.
method Exhibited a specific ribbon Montesinos knot that cannot be a symmetric union.
result Found a ribbon knot that is not a symmetric union.
Solves Skopenkov's problem on graph embedding criteria.
problem Criteria for toroidal embedding of one-vertex ribbon graphs.
method Analyzes one-vertex ribbon graphs with additional disc structure.
result Provides solutions to Skopenkov's problem.
We prove recognition theorems for codimension one manifold factors of dimension n≥4. In particular, we formalize topographical methods and introduce three ribbons properties: the crinkled ribbons property, the twisted crinkled ribbons property, and the fuzzy ribbons property. We show that X×R i…
We develop the concept of Cartan ribbons together with a rolling-based method to ribbonize and approximate any given surface in space by intrinsically flat ribbons. The rolling requires that the geodesic curvature along the contact curve on the surface agrees with the geodesic curvature of the corresponding Cartan deve…
Classifies fibered ribbon pretzels, except for a few cases.
problem Classifying fibered ribbon pretzel knots up to mutation.
method Combining lattice embedding techniques with Gabai's classification of fibered pretzel knots, and exhibiting ribbon disks.
result Complete classification except for a few cases.
This paper investigates symmetric ribbon numbers of low-complexity knots.
problem Determining the minimum number of ribbon singularities in symmetric ribbon disks for knots with up to 12 crossings.
method Systematic investigation using knot polynomials and determinants.
result Novel lower bounds for symmetric ribbon numbers of knots with up to 12 crossings.
Free surface-links are shown to be ribbon links.
problem Characterizing surface-links as ribbon links.
method Four proofs are provided, including a stabilization approach.
result Every free surface-link is a ribbon surface-link.
Revised proof shows ribbonness of surface-links in 4-sphere.
problem Determining ribbonness of surface-links in 4-sphere.
method Surgery along fusion 1-handle systems to prove ribbonness.
result Surface-links in 4-sphere are ribbon if certain conditions are met.
We study the relationship between fibered ribbon 1-knots and fibered ribbon 2-knots by studying fibered slice disks with handlebody fibers. We give a characterization of fibered homotopy-ribbon disks and give analogues of the Stallings twist for fibered disks and 2-knots. As an application, we produce infinite families…
The paper defines cyclic sets from ribbon string links and connects them to quantum invariants.
problem Defining and relating cyclic sets from ribbon string links.
method Endowing ribbon string links with cyclic and cocyclic structures, relating to coend of a ribbon category via quantum invariants.
result Established a relationship between ribbon string links and quantum invariants.
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.
Study ribbon homology concordances using link Floer homology.
problem Understanding ribbon homology concordances and their effects on link Floer homology.
method Combining results from Daemi, Lidman, Vela-Vick, Wong, and Zemke, using link Floer homology and torsion submodules.
result Ribbon homology concordances induce split injections on HFL−. A closer look at an example introduced by Livingston & Melvin and later studied by Miyazaki shows that a plumbing of two fibered ribbon knots (along their fiber surfaces) may be algebraically slice yet not ribbon.
Sharp knots and iterated cables lead to ribbon knots or failure of slice-ribbon conjecture.
problem Understanding the concordance properties of knots and their cables.
method Using Seifert genus and concordance invariant γ0 from bordered Heegaard Floer homology.
result Connected sums of γ0-sharp fibered knots are ribbon only if they are of a specific form, or the slice-ribbon conjecture fails.
New equivalence relation on ribbon graphs connects to virtual links.
problem Understanding virtual links through ribbon graphs.
method Introducing a new equivalence relation on ribbon graphs.
result Correspondence between virtual links and ribbon graphs.