Related papers: Diagram genus, generators and applications

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the…

We develop obstructions to a knot K in the 3-sphere bounding a smooth punctured Klein bottle in the 4-ball. The simplest of these is based on the linking form of the 2-fold branched cover of the 3-sphere branched over K. Stronger…

We study the equivariant genera of strongly invertible and periodic knots. Our techniques include some new strongly invertible concordance group invariants, Donaldson's theorem, and the g-signature. We find many new examples where the…

A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The $\mathbb{Z}_2$-genus of a graph $G$ is the minimum $g$ such that $G$ has an independently even…

This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…

In an earlier paper, we introduced a knot invariant for a null-homologous knot K in an oriented three-manifold Y, which is closely related to the Heegaard Floer homology of Y. In this paper we investigate some properties of these knot…

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollob\'as and Riordan, we introduce a…

A common choice for the evolution of the knotted graphs in loop quantum gravity is to use the Pachner moves, adapted to graphs from their dual triangulations. Here, we show that the natural way to consistently use these moves is on framed…

Given a knot, we develop methods for finding the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of $K$, following an approach developed by…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…

The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…

We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…

This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…

Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\in H(v){4em}\hbox{for every}v\in V(G).$$ Let…

We eliminate 38 infinite families of possible principal graphs as part of the classification of subfactors up to index 5. A number-theoretic result of Calegari-Morrison-Snyder, generalizing Asaeda-Yasuda, reduces each infinite family to a…

We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the `extended Haagerup' principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range…

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove…

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…