Related papers: Diagram genus, generators and applications
In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…
The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…
Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
In this paper we compute the signature for a family of knots $W(k,n)$, the weaving knots of type $(k,n)$. By work of E.~S.~Lee the signature calculation implies a vanishing theorem for the Khovanov homology of weaving knots. Specializing to…
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…
The singular instanton Floer homology was defined by Kronheimer and Mrowka in connection with their proof that the Khovanov homology is an unknot detector. We study this theory for knots and two-component links using equivariant gauge…
The concordance genus of a knot K is the minimum Seifert genus of all knots smoothly concordant to K. Concordance genus is bounded below by the 4-ball genus and above by the Seifert genus. We give a lower bound for the concordance genus of…
Grid diagrams are special representations of knots in the three-sphere that are used to define a combinatorial version of knot Floer homology. Paolo Ghiggini and Yi Ni showed that knot Floer homology detects fibered knots. Their results…
Motivated by an observation of Dehornoy, we study the roots of Alexander polynomials of knots and links that are closures of positive 3-strand braids. We give experimental data on random such braids and find that the roots exhibit marked…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
Our goal is to compute the minimal-order recurrence of the colored Jones polynomial of the 7_4 knot, as well as for the first four double twist knots. As a corollary, we verify the AJ Conjecture for the simplest knot 7_4 with reducible…
Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka in 1957. For symmetric diagrams we develop a two-variable refinement $W_D(s,t)$ of the Jones polynomial that…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
We prove that 0 is a characterizing slope for infinitely many knots, namely the genus-1 knots whose knot Floer homology is 2-dimensional in the top Alexander grading, which we classified in recent work and which include all $(-3,3,2n+1)$…
We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…
Twisting a knot $K$ in $S^3$ along a disjoint unknot $c$ produces a twist family of knots $\{K_n\}$ indexed by the integers. Comparing the behaviors of the Seifert genus $g(K_n)$ and the slice genus $g_4(K_n)$ under twistings, we prove that…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…