arXiv research

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

This note explains how to transform Heegaard diagrams into framed link diagrams.

New minimal link diagrams found, including torus links and homogeneous ones.

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …

Problems on region choices for knot and link diagrams solved using Alexander numbering.

Table of symmetric diagrams for knots up to 10 crossings.

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

Proves minimal crossing diagrams for specific spatial graphs.

Rectangular diagrams help analyze foliations in 3-sphere.

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

The paper explores when specific knot operations simplify diagrams.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

New estimate of semimeander complexity for knots with more than 10 crossings.

Paper proves link diagrams can be realized for some but not all types of links.

GridPyM handles grid diagrams for knot theory.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

The study improves inequalities for link diagrams and introduces weak rectangular diagrams.

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…

Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.

Standard trisection diagrams found for Mazur type 4-manifolds.

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …

Minimal grid diagrams for 12-crossing prime knots identified.

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

Complete criterion for VoI in multi-decision influence diagrams established.

A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost class…

Algorithm constructs Kirby diagrams for 4D open books.

Study minimum ribbonlength of immersed flat knots and links.

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…

Study shows that splitting links requires an arbitrarily large number of extra crossings.

The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.

Parallelization technique for welded links preserves equivalence and yields specific decompositions.

We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to the orientation. But in the case of framed chord diagrams a natural way to define…

The paper analyzes orbits of integer tuples using braid diagrams.

Standard trisection diagrams found for a specific type of knot.

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

Paper simplifies proof of slide-equivalence in crown diagrams.

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

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

In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.

Calculates lower bounds for type III Reidemeister moves in link diagrams.

A marked graph diagram is a link diagram possibly with marked $4$-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa gave local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two…

The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram