Related papers: Diagram genus, generators and applications

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…

We give a combinatorial description of the ``$D_{2n}$ planar algebra,'' by generators and relations. We explain how the generator interacts with the Temperley-Lieb braiding. This shows the previously known braiding on the even part extends…

We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…

This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…

The non-orientable 4-genus of a knot in the 3-sphere is defined as the smallest first Betti number of any non-orientable surface smoothly and properly embedded in the 4-ball, with boundary the given knot. We compute the non-orientable…

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.

A nut graph is a simple graph whose adjacency matrix has the eigenvalue~0 with multiplicity~1 such that its corresponding eigenvector has no zero entries. Motivated by a question of Fowler et al.~[\emph{Disc. Math. Graph Theory} 40 (2020),…

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…

The Magnus expansion is a universal finite type invariant of pure braids with values in the space of horizontal chord diagrams. The Conway polynomial composed with the short circuit map from braids to knots gives rise to a series of finite…

Kearton observed that mutation can change the concordance class of a knot. A close examination of his example reveals that it is of 4-genus 1 and has a mutant of 4-genus 0. The first goal of this paper is to construct examples to show that…

We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…

We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, for each $k$ between $10$ and $27$ we generated $2^{43-k}$…

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers…

Prime knots of genus one admitting diagram with at most five classical crossings were classified by Akimova and Matveev in 2014. In 2018 Kaur, Prabhakar and Vesnin introduced families of L-polynomials and F-polynomials for virtual knots…

Birman-Menasco proved that there are finitely many knots having a given genus and braid index. We give a quantitative version of Birman-Menasco finiteness theorem, an estimate of the crossing number of knots in terms of genus and braid…

We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques…

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…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

This is the first paper in a general program to automate skein theoretic arguments. In this paper, we study skein theoretic invariants of planar trivalent graphs. Equivalently, we classify trivalent categories, which are nondegenerate…