arXiv research

New insights into Khovanov homology complexity and topological structure.

We first show that the braid group over a graph topologically containing no $Θ$-shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph topologically contains none of four prescribed graphs if and only if its 4-braid groups is a r…

Study proves Alexander polynomials of certain 4-braid knots satisfy a conjecture and gives formulas for log-concave sequences.

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand number) braid representations, giving a counterpart to results of Franks-Williams a…

We show that the kernel of $Burau(4) \otimes Z_p$, the reduced Burau representation with coefficients in $Z_p$ of the 4-braid group $B_4$, consists only of pseudo-Anosov braids.

An approach by J.Wu describes homotopy groups $π_{n}(S^2)$ of the standard 2-sphere as isotopy classes of spherical $n+1$--strand Brunnian braids is investigated in the case $n=3$ for applications.

We investigate the cohomology of the level 4 subgroup of the braid group, namely, the kernel of the mod 4 reduction of the Burau representation at $t=-1$. This group is also equal to the kernel of the mod 2 abelianization of the pure braid group. We give an exact formula for the first Betti number; it is a quartic poly…

We construct the first combinatorial 1-cocycle with values in the $\mathbb{Z} [x,x^{-1}]$-module of isotopy classes of singular long knots in 3-space with a signed planar double point, and which represents a non trivial cohomology class in the topological moduli space of long knots. It can be interpreted as an invaria…

In the Khovanov homology of links, presence of $\mathbb{Z}_2$-torsion is a very common phenomenon. Finite number of examples of knots with $\mathbb{Z}_n$-torsion for $n>2$ were also known, none for $n>8$. In this paper, we prove that there are infinite families of links whose Khovanov homology contains $\mathbb{Z}_n$-t…

New groups $Γ_n^k$ connect braids and 3-manifolds.

We show that 3-braid links with given (non-zero) Alexander or Jones polynomial are finitely many, and can be effectively determined. We classify among closed 3-braids strongly quasipositive and fibered ones, and show that 3-braid links have a unique incompressible Seifert surface. We also classify the positive braid wo…

Classifies certain graph 2-braid groups up to quasi-isometry.

We show that there are contact 3-manifolds of support genus one which admit infinitely many Stein fillings, but do not admit arbitrarily large ones. These Stein fillings arise from genus-1 allowable Lefschetz fibrations with distinct homology groups, all filling a fixed minimal genus open book supporting the boundary c…

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…

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 …

Standard trisection diagrams found for Mazur type 4-manifolds.

Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.

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…

Study minimum ribbonlength of immersed flat knots and links.

Algorithm constructs Kirby diagrams for 4D open books.

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.