New minimal link diagrams found, including torus links and homogeneous ones.
problem Finding minimal link diagrams with new classes.
method Morton-Franks-Williams inequality approach.
result New classes of minimal link diagrams, including previously unproven ones.
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
Generates minimal hard surface-link diagrams up to ten crossings.
problem Finding minimal diagrams for surface-links.
method Describes a method for generating minimal hard prime surface-link diagrams.
result Generates all minimal hard prime surface-unknot and surface-unlink diagrams up to ten crossings.
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…
The paper explores minimal coloring numbers for Z-colorable links.
problem Finding the minimum number of colors needed for Z-colorings on minimal diagrams of Z-colorable links. method Investigates minimal diagrams and Z-colorings for Z-colorable links. result For any positive integer N, there exists a minimal diagram of a Z-colorable link with at least N colors in any Z-coloring. Study on knot diagrams showing bridge number can differ from crossing number.
problem Incompatibility between crossing number and bridge number for knot diagrams.
method Defined and compared various bridge number computations for knot diagrams, studied minimizing diagrams, and constructed families of minimal crossing diagrams.
result Found examples where bridge number differs from crossing number, and demonstrated this difference can grow infinitely.
Study finds minimal coloring numbers for torus links using rack colorings.
problem Determining the minimal number of colors for torus link diagrams.
method Using rack colorings on link diagrams to classify minimal colorings.
result Complete classifications of Z-colorings by four colors. This paper finds all prime alternating knots with minimal warping degree two.
problem Finding knots with minimal warping degree.
method Examined all prime alternating knots and determined those with minimal warping degree two.
result All prime alternating knots with minimal warping degree two were identified.
Minimal moves for surfaces in 4D identified.
problem Classifying surfaces embedded in 4D space.
method Derived minimal generating set of planar moves.
result Identified minimal moves for surfaces in 4D.
Minimal grid diagrams found for 13-crossing prime knots with 13 arc index.
problem Finding minimal grid diagrams for prime knots with specific crossing and arc indices.
method Used Knotscape to generate spanning trees and obtain minimal arc presentations in grid diagrams.
result 9,988 prime knots with 13 crossings and 13 arc index were identified.
Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that is irreducibly odd, then it is minimal with respect to the number of classical …
The paper simplifies knot and link diagrams with triple-crossings.
problem Generating and classifying minimal triple-crossing knot and link diagrams.
method Systematic method to generate minimal triple-crossing projections, introducing new diagrammatic moves.
result Classification of knots and links with triple-crossing number up to five, derivation of minimal generating set of moves.
Minimal sets of moves for rotational Reidemeister diagrams are identified.
problem Understanding the minimal sets of moves for rotational Reidemeister diagrams.
method Detailed description and proof of minimal generating sets for rotational Reidemeister moves.
result Minimal generating sets for oriented, framed links contain 5 moves.
Minimal grid diagrams found for 13-crossing prime knots.
problem Finding the simplest grid diagrams for prime knots with 13 crossings.
method Converted prime alternating knots to grid diagrams, focusing on minimal configurations.
result 4878 prime alternating knots with 13 crossings have been represented by grid diagrams with 15 vertical segments.
We prove that a virtual link diagrams satisfying two conditions on the Khovanov homology is minimal, that is, there is no virtual diagram representing the same link with smaller number of crossings. This approach works for both classical and virtual links
Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.
problem Representing prime knots with 14 crossings and specific arc indices using grid diagrams.
method Enumerated all prime knots with 14 crossings, categorized by arc index, and found minimal grid diagrams for those with arc index 14.
result 8,027 knots with arc index 13 and 15,735 knots with arc index 14 were represented by minimal grid diagrams.
Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a classical knot diagram then this minimal surface is a sphere. Using this result a…
This paper constructs explicit trisection diagrams for elliptic surfaces.
problem Constructing explicit trisection diagrams for elliptic surfaces.
method Using handle diagrams from Lefschetz fibrations to create trisection diagrams.
result Explicit (12n−2,0)-trisection diagrams of elliptic surfaces E(n) are constructed. Enumerates knots up to five crossings and describes moves between them.
problem Counting and classifying knots up to a specific number of crossings.
method Generated tables of minimal diagrams and derived moves between knots.
result Conjecture about a lower bound for the triple-crossing number based on Alexander polynomial.
Proves Yoshikawa eighth move's independence and finds minimal band moves.
problem Proving the independence of Yoshikawa eighth move and finding minimal generating set of band moves.
method Defining twisted diagrams and mirror cut surfaces, using surface-link groups.
result Proves independence of Yoshikawa eighth move and finds minimal generating set of band moves.
Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.
problem Understanding minimal crossings of knot diagrams on a punctured sphere.
method Mathematical model of string figures using knot diagrams on xyz-space with missing vertical lines, analyzing minimal crossings under Reidemeister moves. result Minimal number of crossings of knot diagrams on a punctured sphere.
New methods find minimal crossing numbers for surfaces in S4.
problem Determining minimal crossing numbers for surfaces in S4. method Developed new tri-plane diagrams to analyze surfaces.
result Proved minimal crossing numbers for nonorientable unknotted surfaces in S4. We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdi…
Given a knot diagram D, we construct a semi-threading circle for it which can be an axis of D as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to overpasses which give us some information related to the braid index. By this n…
Study essential diagrams of knots in SgimesS1 and their relation to virtual knots.
problem Understanding essential diagrams and their relation to virtual knots in SgimesS1. method Analyzing knots with minimal double lines and embedding virtual knot theory.
result Virtual knot theory is embedded in the theory of knots in SgimesS1. We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms and knots.
A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link diagram on an oriented 2-dimensional surface.) We prove that if a minimal genus …
A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…
A Heegaard diagram for a 3-manifold M is a closed, oriented surface S together with a pair (X, Y) of compact 1-manifolds in S whose components serve as attaching curves for the 2-handles of the two sides of a Heegaard splitting for M. The diagram is positive if X and Y can be oriented so that the intersection number <X…
Proves generalized meander conjectures for knots and spatial graphs.
problem Proving generalized meander conjectures for knots and spatial graphs.
method Study decomposition into simple arcs for diagrams of knots and spatial graphs.
result Proves generalized Jablan--Radović conjectures for knots and spatial graphs.
Proves a theorem for surface links, simplifying diagrams of links.
problem Understanding minimal diagrams of surface links.
method Two-variable generalization of Jones polynomial for surface links.
result Reduced alternating diagrams of surface links have minimal crossing number.
Minimal sets of moves for isotopic knots and trivalent graphs identified.
problem Identifying minimal sets of moves for isotopic knots and trivalent graphs.
method Provided and proved the existence of minimal generating sets of oriented Reidemeister moves for isotopic knots and spatial trivalent graphs.
result Twelve minimal generating sets of oriented Reidemeister moves for isotopic knots and ten for spatial trivalent graphs identified.
Two non-diffeomorphic minimal genus trisections found for a 4-manifold.
problem Existence of non-diffeomorphic minimal genus trisections of the same 4-manifold.
method Introduced a simple operation to create a trisection diagram from a relative trisection diagram.
result Existence of two non-diffeomorphic minimal genus trisections of the same (g,k;p,b)-type 4-manifold. For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…
Venn diagrams are a graphical way to represent a set system. Each of the n sets is represented by a simple closed curve. The n curves subdivide the plane into 2^n open connected regions, each of which represents the intersection of its containing curves' sets. For example, two overlapping circles can divide the plane i…
Study of knots with at most one Hopf crossing number.
problem Classifying knots with minimal crossing number via the Hopf map.
method Analyzing diagrams of links in S2 obtained from S3 with the Hopf map. result Classification of knots with at most one Hopf crossing number, including algebraic knots.
The paper explores parity in knotoids and virtual knots, proving a conjecture and introducing a new polynomial.
problem Investigating parity in knotoids and its relation to virtual knots.
method Introducing a planar parity bracket polynomial and using the Nikonov/Manturov theorem.
result Minimal diagrams of knot-type knotoids have zero height.
To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an oriented surface in which it may be realized. Let g_n denote the expected genus o…
Polynomials derived from Heegaard diagrams for 3-manifolds.
problem Creating polynomial invariants for 3-manifolds.
method Using Heegaard diagrams and cellularly embedded graphs to define polynomials.
result Finiteness of minimal Heegaard graphs for a fixed manifold enables polynomial definition.
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation whose length is a cubic function of the number of 'riser marks'. For classical knots…
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.
Characterizes knots with warping sum ≤ 3 and provides some knots with warping sum 4.
problem Understanding the warping sum of knots and its constraints.
method Characterization and example provision of knots based on their warping sum.
result Knots with warping sum ≤ 3 are characterized, and some knots with warping sum 4 are identified.
Links with minimum tunnel number have one less component than their number of parts.
problem Finding the minimum tunnel number for complex links.
method Combinatorial argument in link diagrams.
result Links with minimum tunnel number have one less component than their number of parts.
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.
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the monotonic simplification theorem for the unknot is given. It is shown that a mi…
For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the nu…