On Alternateness of the Jones-Kauffman Polynomial of Virtual Links
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "On Alternateness of the Jones-Kauffman Polynomial of Virtual Links".
Paper summary: Ada: So looking at the paper "On Alternateness of the Jones-Kauffman Polynomial of Virtual Links", what we've seen is that they’ve successfully defined a class, mock-alternating virtual links, based on a recursive structure and a specific property involving the mock-determinant.
Emmy: And they use this definition to show that you can create an infinite family of these links by taking a given one and applying this twisting technique. They also provide that connected state expansion for the mock-determinant when dealing with checkerboard-colorable links, which is a concrete tool for calculation.
Kolya: From my perspective, what this means for the general community is that we now have a way to test if a virtual link has alternating properties using this polynomial invariant and the mock-determinant as a measurable quantity. It gives us something to count or bound.
Ada: It connects the abstract concept of alternateness in topology with concrete algebraic invariants like this polynomial and its associated determinant, which is useful for classifying links. The paper shows that there are links that have these properties, and it sets up a clear test—the obstruction criterion—to see if they belong to this mock-alternating class.
Emmy: The authors also pose some questions about the bounds on these things. They ask whether there are only finitely many mock-alternating virtual links for any given mock-determinant, and whether the mock-determinant can serve as an upper bound for the crossing number of any such link.
Kolya: Those are big open questions, right? The paper doesn't solve them entirely, but it gives us a starting point with these conjectures. It’s about how many of these links exist before we even worry about their complexity in terms of crossings.
Ada: Yes, the paper concludes by showing that the class of alternating virtual links isn't fully contained within the mock-alternating class, and it points out a specific case where a link with two components and a crossing number one is mock-alternating at that single crossing, even though it doesn't satisfy the alternating property.
Emmy: It shows that this new concept helps us map out the landscape of virtual links more finely, even highlighting cases where the two concepts diverge. This work really builds on earlier ideas about Jones polynomials in virtual link theory.
Conclusion: Ada: So we've been looking at how these mock alternating links are defined using that polynomial invariant and its mock determinant, and now we’re getting to the end of this paper, "On Alternateness of the Jones-Kauffman Polynomial of Virtual Links."
Emmy: It turns out the authors were really focused on building this specific class from scratch, starting with a recursive definition based on smoothing links and checking that mock determinant value.
Kolya: And they used that structure to prove something important about the Jones-Kauffman polynomial itself, showing it's alternating if the link is mock alternating.
Ada: The main thing here is setting up this clear test—that obstruction criterion—to figure out if a link actually belongs in this mock class or not.
Emmy: It really clarifies that while we have these nice classes of links, they aren't always the same thing, which is a key structural point.
Kolya: The paper ends by asking some big questions about how many of these mock alternating links there can actually be for a given mock determinant value.
Ada: Yeah, and they also wonder if this mock determinant can actually give us an upper limit on the crossing number of those links.
Emmy: It leaves you wondering what this means for the general landscape of virtual knots and whether these tools are strong enough to fully characterize them.
HAMID ABCHIR, KHALED QAZAQZEH, MOHAMMED SABAK
University of Hassan II EST · Yarmouk University
math.GT
Submitted: 2026-10-05
Updated: 2026-11-18
Comments: 15 pages, 6 Figures, 3 tables. An example and two references have been added
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The gist: On alternateness of the Jones-Kauffman polynomial of virtual links studies a class of virtual links with an alternating Jones-Kauffman polynomial called mock-alternating virtual links and develops…
Key concepts
- Mock-Alternating Virtual Links
- This is a specific class of virtual links defined recursively. A link belongs to this set if it has a crossing where smoothing the link results in two sub-links that are also mock-alternating, and their associated mock-determinants meet certain conditions.
- Mock-Determinant (mdet(L))
- The mock-determinant is an invariant derived from the Jones-Kauffman polynomial by taking its L1-norm at the eighth root of unity. It generalizes the determinant concept for classical links and has properties related to whether a link is split or checkerboard colorable.
- Alternating Property
- This property applies to the Jones-Kauffman polynomial when evaluated at a specific value (A). If a link is mock-alternating, this polynomial is alternating, meaning both its components ($\Phi$ and $\Psi$) exhibit an alternating behavior.
- Obstruction Criterion
- This criterion uses the alternating property of the Jones-Kauffman polynomial as a test. If the polynomial $fL(A)$ is found not to be alternating, it serves as a proof that the link $L$ cannot be mock-alternating, effectively ruling out certain links.
Summary
On alternateness of the Jones-Kauffman polynomial of virtual links studies a class of virtual links with an alternating Jones-Kauffman polynomial called mock-alternating virtual links and develops tools to characterize them
Defining Mock-Alternating Links
The paper defines the class of mock-alternating links recursively based on a set of properties The set M of mock-alternating links is the smallest set satisfying several conditions, including the unknot belonging to M A link L is in M if it has a crossing c such that the links L0 and L1 represented by smoothings D0 and D1 belong to M and satisfy mdet(L0), mdet(L1) ≥ 1, and mdet(L) = mdet(L0) + mdet(L1) This recursive definition establishes the class of mock-alternating virtual links
Polynomial Invariants and Mock-Determinant
The Jones-Kauffman polynomial fL(t) is an invariant of oriented virtual links defined in terms of the Kauffman bracket The mock-determinant mdet(L) is defined as the L1-norm of the specialization of the Jones-Kauffman polynomial at eighth root of unity, specifically mdet(L) = fL(ξ)1 = ΦL(ξ) + ΨL(ξ) This definition extends the determinant for classical links as a consequence of facts about Theorem 2.6 and Remark 2. p. 27
Alternating Property and Obstruction
Theorem 3.3 states that if L is a mock-alternating virtual link, then the Jones-Kauffman polynomial fL(A) is alternating, meaning both ΦL(A) and ΨL(A) are alternating The paper derives an obstruction criterion: Corollary 3. p. 04 states that if fL(A) is not alternating, then L is not mock-alternating virtual link This implies that the class of alternating virtual links is not contained in the class of mock-alternating virtual links
Generating Infinite Families
The authors use a twisting technique to generate an infinite family of mock-alternating virtual links from a given one Theorem 3.7 proves that if D is a mock-alternating virtual link diagram at some crossing c, then the link diagram Dc←r obtained by replacing the crossing c by a rational tangle r that extends c is mock-alternating at each crossing of r This technique involves extending a crossing by a rational tangle which is an alternating rational tangle
Properties of the Mock-Determinant
Several properties are established for the mock-determinant, including Proposition 4.1, which states that if L is a split link, then mdet(L) = 0 Proposition 4. p. 82 shows that if L is the connected sum of two links L1 and L2, then mdet(L) ≤ mdet(L1) mdet(L2), with equality holding if one of the two links is checkerboard colorable Furthermore, Proposition 4. p. 83 indicates that if the number of components of L is odd or even, then mdet(L) is odd or even respectively The paper also gives a connected state expansion for checkerboard colorable links, leading to an expression for mdet(D)
Applications and Conjectures
The paper provides examples of virtual knots that are not mock-alternating virtual links using the obstruction in Corollary 3.4 The authors also pose two questions motivated by conjectures for the class of quasi-alternating links, namely Question 3. p. 89 regarding whether there are only finitely many mock-alternating virtual links of a given mockdeterminant and Question 3. p. 810 concerning whether the mock-determinant represents an upper bound of the crossing number for any such link The paper concludes by showing that the class of alternating virtual links is not contained in the class of mock-alternating virtual links The only virtual link of two components of crossing number one is mock-alternating at the only crossing according to Definition 3. p. 51 even though that is not alternating virtual link The authors acknowledge that AI has been lightly used for the sole purpose of typesetting assistance, grammatical correction, and paraphrasing during this work
References
[1] H. Abchir, K. Qazaqzeh, and M. p. 0 Sabak, A new polynomial for checkerboard-colorable 4-valent virtual graphs, Graphs Comb. p. 1 41(3) (2025): 19 pages
[2] H. Boden, M. Chrisman, and H. Karimi, The Gordon–Litherland pairing for links in thickened surfaces, Internat. J. Math., 33(10-11) (2022), Paper No. p. 0 2250078, 47
[3] H. Boden, and H. Karimi, Classical results for alternating virtual links, New York J. p. 3 Math., 28 (2022): 1372–1398
[4] A. Champanerkar and I. Kofman, Twisting Quasi-alternating Links, Proc. p. 0 Amer. Math. Soc., 137 (7) (2009): 2451–2458
[5] N. Chbili and K. Kaur, Extending Quasi-alternating Links, J. p. 5 Knot Theory Ramifications 29 (11) (2020): 2050072
[6] J. Green, A table of virtual Knots available at https://www. p. 5math.toronto.edu/drorbn/Students/GreenJ/ last updated August 10, 2004
[7] J. Greene, Homologically thin, non-quasi-alternating links, Math. p. 0 Res. Lett., 17 (1): 39–49, 2010
[8] M. Goussarov, M. Polyak, and O. Viro, Finite-type invariants of classical and virtual knots, Topology, 39 (5) (2000): 1045–1068
[9] T. Hatano and Y. Nozaki, On determinant of checkerboard-colorable virtual links, arXiv: 2408. p. 001891v1
[10] V. Jones, A polynomial invariant for knots via von Neumann algebras, Bull. p. 0 Amer. Math. Soc. 12 (1985), 103–111
[11] N. Kamada, On the Jones polynomials of checkerboard-colorable virtual knots, Osaka J. p. 8 Math., 39: 325–333, 2002
[12] N. Kamada and Y. Miyazawa, A 2-variable polynomial invariant for a virtual link derived from magnetic graphs, Hiroshima Math. p. 0 J., 35 (2): 309–326, 2005
[13] L. Kauffman, Virtual Knot Theory, Europ. p. 0 J. Combinatorics, 20: 663–691, 1999
[14] L. H. Kauffman, State models and the Jones polynomial, Topology, 26(3) (1987), 395–407
[15] L. Kauffman and P. p. 0 Lopes, Determinants of rational knots, Discrete Math. p. 0 Theoret Comput. Sci., 11(2):111–122, 2009
[16] K. Murasugi, On invariants of graphs with applications to knot theory, Trans. p. 0 Amer. Math. Soc. 314: 1–49, 1989
[17] P. Ozsv´ath and Z. p. 0 Szab´o, On the Heegaard Floer homology of branched double-covers, Adv. p. 0 Math., 194 (1): 1–33, 2005
[18] K. Qazaqzeh, N. p. 0 Chbili, and B. Qublan, Characterization of quasi-alternating Montesinos links, J. p. 0 Knot Theory Ramifications 24(1):155000 (13 pages), 2015
[19] K. Qazaqzeh, B. p. 0 Qublan, and A. Jaradat, A remark on the determinant of quasi-alternating links, J. p. 0 Knot Theory and its Ram. 22 (6): 1350031 (13 pages), 2013
[20] M.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
More accurately characterize mock-alternating virtual links by using an obstruction criterion for a virtual link to be mock-alternating, as suggested in Definition 3.2 and Theorem 3.3. This allows AI systems to definitively classify links as either alternating, mock-alternating, or neither based on the properties of their Jones-Kauffman polynomial.
-
Implement a method to generate an infinite family of mock-alternating virtual links from a given one using the twisting technique introduced in [4] and generalized in [5, 18]. This enables AI systems to explore vast families of links that possess alternating Jones-Kauffman polynomials starting from simpler base cases.
-
Develop a system capable of calculating the mock-determinant for checkerboard colorable links using the connected state expansion derived in Proposition 4.5 and Formula in Remark 4.4. This allows AI to efficiently compute this invariant for specific classes of virtual links, providing a numerical tool related to link structure.
-
Create a function that utilizes the property that
If L is a split link, then mdet(L) = 0
(Proposition 4.1) or "mdet(L) <= mdet(L1) mdet(L2)" (Proposition 4.2). This allows AI to quickly determine if a given link is split or to establish an upper bound for its mock-determinant based on its connected sum decomposition. -
Integrate the property that
If fL(A) is not alternating, then L is not mock-alternating virtual link
(Corollary 3.4) into the classification pipeline. This provides a fast filtering step to eliminate links that do not meet the basic structural requirement for being mock-alternating before performing more complex calculations.
Sources
Related papers
- Uncomputable trisection invariants of 4-manifolds
- One internal stabilization is enough for resolving self-referential tubes
- The proper geometric dimension of the mapping class groups of non-orientable surfaces with punctures
- 2-Linearizability of Geometric 3-Manifold Groups Over Commutative Rings
- A Faithful Action of the Mapping Class Group Mod(S g) on the (2g-1) -Sphere
- Profinite Non-Rigidity of Arithmetic Lattices and the K"ahler Property