English
Related papers

Related papers: Hard diagrams of split links

200 papers

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component…

Geometric Topology · Mathematics 2018-05-02 Haruko A. Miyazawa , Kodai Wada , Akira Yasuhara

The reduced peripheral system was introduced by Milnor in the fifties for the study of links up to link-homotopy, i.e. up to isotopies and crossing changes within each link component. However, for four or more components, this invariant…

Geometric Topology · Mathematics 2024-11-20 Benjamin Audoux , Jean-Baptiste Meilhan

In mathematics, a knot is a single strand of string crossed over itself any number of times, and connected at the ends. The Reidemeister Moves have been proven to be the three core moves necessary to fully untangle a knot. Some knots can be…

Geometric Topology · Mathematics 2017-02-08 Dana Foley

We introduce some chain maps between Khovanov complexes. Each of the chain maps commutes with a chain homotopy map and a retraction maps which obtain a Reidemeister invariance of Khovanov homology.

Geometric Topology · Mathematics 2009-10-07 Noboru Ito

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

Geometric Topology · Mathematics 2018-06-13 Charles Livingston

In this survey paper we present results about link diagrams in Seifert manifolds using arrow diagrams, starting with link diagrams in $F\times S^1$ and $N\hat{\times}S^1$, where $F$ is an orientable and $N$ an unorientable surface.…

General Topology · Mathematics 2018-02-14 Boštjan Gabrovšek , Maciej Mroczkowski

This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…

Geometric Topology · Mathematics 2026-05-06 Makoto Ozawa

We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…

Combinatorics · Mathematics 2025-11-14 Erica Flapan , Hugh Howards

Recently N.A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture…

Geometric Topology · Mathematics 2009-09-29 Sergei Chmutov

The aim of this paper is to define certain algebraic structures coming from generalized Reidemeister moves of singular knot theory. We give examples, show that the set of colorings by these algebraic structures is an invariant of singular…

Geometric Topology · Mathematics 2018-06-21 Indu R. U. Churchill , M. Elhamdadi , M. Hajij , Sam Nelson

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…

Geometric Topology · Mathematics 2018-03-13 Margaret Allardice , Ethan D. Bloch

We investigate the geometry of hyperbolic knots and links whose diagrams have a high amount of twisting of multiple strands. We find information on volume and certain isotopy classes of geodesics for the complements of these links, based…

Geometric Topology · Mathematics 2009-06-25 Jessica S. Purcell

For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…

Geometric Topology · Mathematics 2025-11-05 Gustavo Cardoso , Oscar Ocampo

We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume.…

Geometric Topology · Mathematics 2017-01-31 Malik Obeidin

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

Geometric Topology · Mathematics 2007-05-23 Matias Graña , Vladimir Turaev

An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…

Computational Geometry · Computer Science 2022-09-23 Steven Chaplick , Thomas C. van Dijk , Myroslav Kryven , Ji-won Park , Alexander Ravsky , Alexander Wolff

We introduce a multi-parameter deformation of the triply-graded Khovanov--Rozansky homology of links colored by one-column Young diagrams, generalizing the "$y$-ified" link homology of Gorsky--Hogancamp and work of Cautis--Lauda--Sussan.…

Geometric Topology · Mathematics 2021-07-21 Matthew Hogancamp , David E. V. Rose , Paul Wedrich

Khovanov and Rozansky's categorification of the HOMFLY-PT polynomial is invariant under braidlike isotopies for any link diagram and Markov moves for braid closures. To define HOMFLY-PT homology, they required a link to be presented as a…

Quantum Algebra · Mathematics 2018-03-16 Michael Abel

We study RNA foldings and investigate their topology using a combination of knot theory and embedded rigid vertex graphs. Knot theory has been helpful in modeling biomolecules, but classical knots place emphasis on a biomolecule's…

Geometric Topology · Mathematics 2022-07-28 Jose Ceniceros , Mohamed Elhamdadi , Josef Komissar , Hitakshi Lahrani

A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…

Data Structures and Algorithms · Computer Science 2013-06-25 Martin Fink , Sergey Pupyrev
‹ Prev 1 3 4 5 6 7 10 Next ›