This paper defines ribbons and ribbon complexes in CW spaces and analyzes their topological properties.
problem Characterizing and analyzing topological structures in CW spaces.
method Introducing planar ribbons, ribbon complexes, and ribbon nerves in Alexandroff-Hopf-Whitehead CW spaces, and studying their topological properties.
result Characterization of ribbons and ribbon nerves by Betti numbers and homotopy types.
Optimal flat ribbons can be created from nonplanar curves with minimal energy.
problem Finding the optimal shape of flat ribbons from nonplanar curves.
method Direct method of the calculus of variations.
result Optimal flat ribbons can be created with minimal bending energy, but they may have isolated planar points.
Ribbon tangles are proper embeddings of tori and cylinders in the 4-ball~B4, "bounding" 3-manifolds with only ribbon disks as singularities. We construct an Alexander invariant A of ribbon tangles equipped with a representation of the fundamental group of their exterior in a free abelian group G. Th…
It is known that there are 21 ribbon knots with 10 crossings or fewer. We show that for every ribbon knot, there exists a tangle that satisfies two properties associated with the knot. First, under a specific closure, the closed tangle is equivalent to its corresponding knot. Second, under a different closure, the clos…
Quantum model for knotted graphs from knot theory.
problem Constructing an isotopy invariant polynomial for knotted bipartite ribbon graphs.
method Applying quantum topology to construct an isotopy invariant polynomial.
result Computed the expected number of loops in the double dimer model.
We prove two results on the classification of trivial Legendrian embeddings g:G→(S3,ξstd) of planar graphs. First, the oriented Legendrian ribbon Rg and rotation invariant rotg are a complete set of invariants. Second, if G is 3-connected or contains K4 as a minor, then the unique t…
This paper studies fixed sets in ribbon complexes using descriptive proximity spaces.
problem Understanding fixed sets in ribbon complexes within descriptive proximity spaces.
method Introduces descriptive fixed sets and their properties in ribbon complexes, using descriptive proximally continuous maps.
result Establishes that proximal descriptive conjugacy preserves fixed sets in ribbon complexes.
For a ribbon graph G we consider an alternating link LG in the 3-manifold G×I represented as the product of the oriented surface G and the unit interval I. We show that the Kauffman bracket [LG] is an evaluation of the recently introduced Bollobas-Riordan polynomial RG. This results generalizes t…
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.
Alternating links bound rational homology balls if their chessboard lattice is cubiquitous.
problem When do alternating links bound rational homology balls?
method Heegaard Floer homology and flows on planar graphs.
result The normalized determinant of the link's chessboard lattice is a necessary and sufficient condition for the link to bound a rational homology ball.
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the Tutte polynomial of planar graphs to graphs that are embedded in closed oriented s…
We show that the Kauffman bracket [L] of a checkerboard colorable virtual link L is an evaluation of the Bollobás-Riordan polynomial RGL of a ribbon graph associated with L. This result generalizes Thistlethwaite's celebrated theorem relating the Kauffman bracket with the Tutte polynomial of planar graphs.
Paper describes a state sum formula for a graph coloring polynomial.
problem Counting n-face colorings of ribbon graphs for various n. method Combines topological quantum field theory and diagrammatic tensors.
result Describes a state sum formula for the total face color polynomial.
New invariant shows fifth move is unique and extends biquandle theory for surface-links.
problem Reproduce Yoshikawa's fifth move using other moves and isotopies.
method Develops a semi-invariant and biquandle-based invariant for surface-links.
result Yoshikawa's fifth move is unique and cannot be reproduced by other moves.
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, t…
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.
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.
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.
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.
Extends Heisenberg homology to ribbon graphs.
problem Configurations in bounded surfaces.
method Regular thickening of ribbon graphs.
result Heisenberg homology applied to ribbon graphs.
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−. 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.
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.
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.
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible wi…
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.