Turaev Genus: Diagrammatic Invariant & Insights

• Turaev genus is defined via the Turaev surface constructed from all-A and all-B states, quantifying how far a link is from being alternating.
• It provides a lower bound for the dealternating number and sharply correlates with polynomial invariants like the Jones polynomial in adequate settings.
• Its computation bridges diagrammatics and knot homology theories, offering practical insights into classifying low-genus links and understanding concordance properties.

Searching arXiv for recent and foundational papers on Turaev genus. The Turaev genus of a link is a diagrammatic and topological invariant defined from the Turaev surface associated to a link diagram. It measures how far a link is from being alternating: for a non-split link $L$, one has $g_T(L)=0$ if and only if $L$ is alternating (Champanerkar et al., 2014). The invariant is constructed from the all-$A$ and all-$B$ Kauffman states of a diagram, and then minimized over all diagrams of the link. Because the projection becomes alternating on the Turaev surface, the invariant occupies a central position between planar diagrammatics, polynomial invariants, ribbon graphs, and knot homology theories (Champanerkar et al., 2014).

1. Definition via the Turaev surface

Let $D$ be a link diagram. At each crossing one has an $A$-resolution and a $B$-resolution, and a state is any choice of smoothing at every crossing. Write $s_A(D)$ and $s_B(D)$ for the all-$g_T(L)=0$0 and all-$g_T(L)=0$1 states. Turaev’s construction places the all-$g_T(L)=0$2 state on one side of the projection sphere and the all-$g_T(L)=0$3 state on the other, connects them by saddles at the crossings, and caps the resulting boundary components with disks to obtain a closed orientable surface $g_T(L)=0$4 (Jin et al., 2017).

For a connected diagram $g_T(L)=0$5, the genus of the Turaev surface is

$g_T(L)=0$6

where $g_T(L)=0$7 is the number of crossings of $g_T(L)=0$8 (Jin et al., 2017). More generally, for a diagram with $g_T(L)=0$9 split components regarded as a $L$0-valent graph, one has

$L$1

(Armond et al., 2015). The Turaev genus of a link $L$2 is then

$L$3

(Champanerkar et al., 2014).

The basic structural properties are fundamental. The surface $L$4 is an unknotted closed orientable surface in $L$5, the diagram $L$6 is alternating on $L$7, and $L$8 exactly when $L$9 is alternating (Champanerkar et al., 2014). This gives the invariant its standard interpretation as a quantitative measure of non-alternatingness. A plausible implication is that Turaev genus is best viewed not as an isolated diagrammatic statistic, but as the genus cost required to recover alternating behavior.

2. Alternating distance and related diagrammatic invariants

The Turaev genus is one of several invariants designed to measure deviation from alternation. A closely related quantity is the dealternating number $A$0, defined as the minimum number of crossing changes needed to turn some diagram of $A$1 into an alternating diagram. Abe and Kishimoto proved the inequality

$A$2

(Jin et al., 2017). Thus Turaev genus always provides a lower bound for dealternating number.

The same viewpoint underlies the role of almost alternating links. A diagram is almost alternating if one crossing change makes it alternating, and a knot is almost alternating if it admits such a diagram but has no alternating diagram (Jablan, 2014). Every almost alternating knot has Turaev genus $A$3 (Jablan, 2014). This places genus one links at the first nontrivial level beyond the alternating class.

Subadditivity under connected sum is also part of the structure: $A$4 (Jung et al., 2020). For adequate knots, the survey literature records additivity under connected sum and mutation invariance within the adequate class (Champanerkar et al., 2014). More recently, an additivity criterion was obtained using concordance invariants: if a knot $A$5 satisfies

$A$6

then equality holds, and if two knots satisfy this condition, Turaev genus is additive on their connected sum (Jung et al., 2020).

These relations show that Turaev genus behaves simultaneously as a diagrammatic invariant, an alternating-distance invariant, and a structural invariant for operations such as connected sum. This suggests that its utility lies partly in the fact that it interfaces with several distinct complexity measures without reducing to any single one of them.

3. Polynomial and adequacy characterizations

The earliest and most persistent connection is with the Jones polynomial. For a non-split link $A$7, one has

$A$8

with equality for adequate links (Champanerkar et al., 2014). Equivalently, for adequate links,

$A$9

(Champanerkar et al., 2014). This places Turaev genus in direct relation with the failure of the Jones span to reach the crossing number.

Adequacy is defined diagrammatically. A diagram $B$0 is $B$1-adequate if no crossing has its two $B$2-resolved arcs lying in the same component of the all-$B$3 state, and $B$4-adequate is defined similarly; a link is adequate if it admits a diagram that is both $B$5- and $B$6-adequate (Qazaqzeh et al., 25 Jul 2025). Every reduced alternating diagram is adequate, but adequacy is strictly broader than alternation (Qazaqzeh et al., 25 Jul 2025). Adequate diagrams minimize crossing number, and Abe showed that they also minimize Turaev genus (Qazaqzeh et al., 25 Jul 2025).

A sharp genus-one characterization was obtained in 2025. A non-split link $B$7 is adequate and has $B$8 if and only if

$B$9

(Qazaqzeh et al., 25 Jul 2025). This refines the classical alternating characterization $D$0 by identifying the first non-alternating adequate level exactly one unit below the crossing number (Qazaqzeh et al., 25 Jul 2025). The same work derives further consequences: if a non-split link satisfies $D$1, then it is not quasi-alternating, has arc index $D$2, has Jones diameter $D$3, and the leading and trailing coefficients of $D$4 have absolute value one (Qazaqzeh et al., 25 Jul 2025).

Related genus-one results were obtained earlier for the extreme coefficients of the Jones polynomial. If

$D$5

with $D$6, then for an almost alternating link or a link of Turaev genus one, either $D$7 or $D$8 (Dasbach et al., 2016). This provides a practical obstruction: if both extreme coefficients have absolute value greater than $D$9, then the link cannot be almost alternating and cannot have Turaev genus one (Dasbach et al., 2016).

Together these results show that the Jones polynomial does not merely correlate with Turaev genus; in the adequate setting, and especially in genus one, it often detects it sharply.

4. Homological and concordance bounds

A second major theme is the relationship between Turaev genus and knot homology theories. The survey literature records the width bounds

$A$0

for reduced Khovanov homology and knot Floer homology, respectively (Champanerkar et al., 2014). These inequalities imply that homological thickness yields lower bounds for Turaev genus.

A more refined perspective comes from spanning-tree and ribbon-graph models. For a diagram $A$1, the Turaev surface genus equals the $A$2-width of the spanning-tree complex: $A$3 (Dasbach et al., 2010). Lowrance’s inequality then gives

$A$4

and this was used effectively in the study of torus knots (Jin et al., 2017).

The invariant also controls concordance-type quantities. For any knot $A$5,

$A$6

(Dasbach et al., 2010). In particular, if $A$7, then

$A$8

(Dasbach et al., 2010). This recovers the classical alternating pattern from the vanishing of Turaev genus.

The 2020 work on concordance invariants recast these bounds in a broader framework. A concordance invariant $A$9 belongs to a class $B$0 if it changes by at most one under an oriented band surgery and satisfies

$B$1

(Jung et al., 2020). Rasmussen’s $B$2-invariant, $B$3 for $B$4, $B$5, and invariants of the form $B$6 coming from slice-torus link invariants all lie in $B$7 (Jung et al., 2020). The central theorem is

$B$8

(Jung et al., 2020). A notable consequence is that these bounds can be nontrivial for quasi-alternating knots, unlike many earlier lower bounds (Jung et al., 2020).

This homological and concordance picture establishes Turaev genus as a bridge invariant: it is defined diagrammatically, but it is often most effectively bounded or detected by Floer-theoretic, Khovanov-theoretic, and concordance data.

5. Low-genus structure and classification

Low Turaev genus imposes rigid diagrammatic structure. One approach uses alternating decomposition graphs. Starting from a diagram $B$9, one marks non-alternating edges and constructs the alternating decomposition $s_A(D)$0, then defines a graph $s_A(D)$1 whose vertices correspond to the curves $s_A(D)$2 and whose edges correspond to non-alternating edges of $s_A(D)$3 (Armond et al., 2015). The graph is planar, bipartite, and every vertex has even degree (Armond et al., 2015).

A central theorem states that if two diagrams have isomorphic alternating decomposition graphs, then they have the same Turaev genus (Armond et al., 2015). Equivalently, the Turaev genus is determined by the graph $s_A(D)$4. The same paper gives a recursive algorithm based on deletion/contraction of parallel edges and contraction at degree-two vertices, and proves that for every non-negative integer $s_A(D)$5, there are only finitely many doubled path equivalence classes of reduced alternating decomposition graphs with Turaev genus $s_A(D)$6 (Armond et al., 2015).

In genus one, the reduced alternating decomposition graphs are exactly the doubled cycles of even length, equivalently graphs doubled path equivalent to $s_A(D)$7 (Armond et al., 2015). In genus two, there are exactly five doubled path equivalence classes of reduced alternating decomposition graphs (Armond et al., 2015).

A complementary classification uses cutting arcs and cutting loops on the Turaev surface. For a prime non-alternating diagram, there exists a cutting arc; every cutting arc determines a cutting loop; and surgery along it reduces Turaev genus by one: $s_A(D)$8 (Kim, 2015). Using this machinery, prime connected diagrams with $s_A(D)$9 are classified as cycles of alternating $s_B(D)$0-tangles, and prime genus-two diagrams fall into eight alternating-tangle structures (Kim, 2015).

These classifications lead to further consequences. Every non-split Turaev genus one link has a diagram that is either $s_B(D)$1-adequate, $s_B(D)$2-adequate, or almost alternating (Dasbach et al., 2018, Beldon et al., 2022). For prime non-split inadequate links of Turaev genus one, the link is almost-alternating (Kim, 2015). A plausible implication is that genus one is not merely the first nonzero value of the invariant; it is a highly constrained regime with multiple equivalent-looking structural descriptions.

6. Computations, examples, and open phenomena

Explicit computations form a substantial part of the theory. For torus knots with five or fewer strands, exact values and near-exact bounds are known. Among the main formulas are

$s_B(D)$3

$s_B(D)$4

and

$s_B(D)$5

(Jin et al., 2017). Corresponding dealternating bounds show that in these families the dealternating number exceeds the Turaev genus by at most one or two (Jin et al., 2017). The proofs combine lower bounds from knot Floer homology with explicit braid diagrams whose Turaev surfaces realize the bounds (Jin et al., 2017).

For low-crossing knots, explicit almost alternating constructions have resolved many genus-one cases. Among non-alternating knots with $s_B(D)$6 crossings in KnotInfo, Turaev genus was unknown for $s_B(D)$7 knots; $s_B(D)$8 were shown to be almost alternating, hence have Turaev genus $s_B(D)$9, leaving $g_T(L)=0$00 unresolved in that work (Jablan, 2014).

Genus one also exhibits strong homological rigidity. If $g_T(L)=0$01 is a non-split Turaev genus one link, then its Khovanov homology is $g_T(L)=0$02 in at least one extremal quantum grading (Dasbach et al., 2018). The 2022 refinement showed that for a nonsplit Turaev genus one link, a particular near-extremal summand is trivial, which leads to computations of the Rasmussen $g_T(L)=0$03-invariant and bounds on the smooth four-genus for certain Turaev genus one knots (Beldon et al., 2022).

Not all structures associated with minimal-genus diagrams are genuine knot invariants. Champanerkar and Kofman had asked whether the polynomial $g_T(L)=0$04 counting quasi-trees of the all-$g_T(L)=0$05 ribbon graph of a minimal Turaev genus diagram is an invariant of the knot. A counterexample using two minimal-genus diagrams of $g_T(L)=0$06 shows the answer is negative: one diagram yields

$g_T(L)=0$07

while the other yields

$g_T(L)=0$08

(Armond et al., 2014). This demonstrates that even in the minimal-genus setting, ribbon-graph data can depend on the chosen diagram rather than only on the underlying knot.

A current direction links Turaev genus to arc presentations. For a non-split prime link $g_T(L)=0$09, the conjecture

$g_T(L)=0$10

has been verified for alternating links, links with Turaev genus one, adequate links, closures of positive $g_T(L)=0$11-braids, torus links, and most Kanenobu knots (Vílchez et al., 25 Sep 2025). For adequate links, equality holds: $g_T(L)=0$12 (Vílchez et al., 25 Sep 2025). This suggests a broader organizing principle in which Turaev genus mediates between crossing number, arc index, adequacy, and near-alternating structure.

Across these developments, the recurring pattern is that Turaev genus is simultaneously computable, structurally rigid in low genus, sensitive to homological thickness, and subtle enough that diagram-dependent ribbon-graph refinements can fail to descend to knot invariants. That combination explains its central role in the contemporary study of alternating distance.