pith. sign in

arxiv: 2606.13161 · v1 · pith:CIKTWATNnew · submitted 2026-06-11 · 💻 cs.DM · cs.DS

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

Alexander Omelchenko This is my paper

Pith reviewed 2026-06-27 05:04 UTC · model grok-4.3

classification 💻 cs.DM cs.DS
keywords genus-one knotstorus mapsknot tabulationpermutation encodingKauffman bracket4-regular mapscrossing numberlink diagrams
0
0 comments X

The pith

Permutation encoding produces the first complete tabulation of genus-one knots and links up to eight crossings

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops an algorithmic framework that encodes cellular 4-regular projections on the torus using pairs of permutations and enumerates unsensed equivalence classes via canonical representatives to avoid duplicates. It validates the method against known classifications up to five crossings before extending the computation to six, seven, and eight crossings. This produces the first exhaustive dataset of more than 33,000 knot and link types under the given conventions, together with proved results such as a parity property for the a-span of the bracket and a sharp upper bound of N-1 on the number of bigon faces. A sympathetic reader would care because the complete list supplies the basic data needed to study invariants and properties of knots embedded on the torus.

Core claim

Cellular 4-regular torus projections are encoded by permutation pairs (alpha, sigma), and unsensed equivalence classes are enumerated completely and without duplication via canonical representatives. Crossing assignments, local diagram-level reductions, and the generalized Kauffman-type bracket are formulated entirely within the same permutation model, producing the first complete genus-one tabulation at crossing numbers 6, 7, and 8 with a dataset of more than 33,000 knot and link types, plus proved structural facts including a parity statement for the a-span of the bracket and a sharp upper bound of N-1 for the number of bigon faces in a 4-regular torus map.

What carries the argument

Permutation pairs (alpha, sigma) encoding cellular 4-regular torus projections, together with canonical-representative enumeration of unsensed equivalence classes

If this is right

  • The resulting dataset contains more than 33,000 distinct knot and link types at crossing numbers 6, 7, and 8.
  • A parity statement holds for the a-span of the bracket polynomial.
  • A sharp upper bound of N-1 holds for the number of bigon faces in any 4-regular torus map.
  • The computation suggests conjectures including a formula for the maximum number of straight-ahead components and a 4N upper bound for the genus-one bracket span.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • A verified complete list would support exhaustive computational checks for other invariants or geometric properties of genus-one knots.
  • The permutation encoding approach could be adapted to produce diagrams on higher-genus surfaces or with additional constraints such as fixed number of components.
  • The proved bound on bigon faces might help classify minimal diagrams or constrain possible embeddings in the thickened torus.

Load-bearing premise

The encoding of cellular 4-regular torus projections by permutation pairs together with canonical representatives captures every distinct diagram exactly once up to eight crossings, with no omissions or overcounting from local reductions or crossing assignments.

What would settle it

Discovery of one genus-one knot or link diagram with six crossings that cannot be represented by any enumerated permutation pair, or the appearance of the same diagram twice in the generated list under the stated equivalence conventions.

read the original abstract

We present an algorithmic framework for the exhaustive generation and tabulation of knot and link diagrams on the thickened torus T^2 x I, based on the theory of maps on surfaces. Cellular 4-regular torus projections are encoded by permutation pairs (alpha, sigma), and unsensed equivalence classes are enumerated completely and without duplication via canonical representatives. Crossing assignments, local diagram-level reductions, and the generalized Kauffman-type bracket are formulated entirely within the same permutation model. The pipeline is validated against published genus-one classifications for crossing numbers N <= 5 and then extended to N = 6, 7, 8, producing, to our knowledge, the first complete genus-one tabulation at these crossing numbers under the stated comparison conventions. The resulting dataset contains more than 33,000 knot and link types. Besides the tables, the computation yields proved structural facts, including a parity statement for the a-span of the bracket and a sharp upper bound N-1 for the number of bigon faces in a 4-regular torus map. It also suggests several conjectures, among them a formula for the maximum number of straight-ahead components, the absence of equi-quadrilateral knot projections, and a 4N upper bound for the genus-one bracket span.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript presents an algorithmic framework for exhaustive generation of knot and link diagrams on the thickened torus, encoding cellular 4-regular projections via permutation pairs (α, σ) and enumerating unsensed equivalence classes through canonical representatives. Crossing assignments, local reductions, and the generalized Kauffman bracket are handled uniformly in the permutation model. The pipeline is validated against published genus-one results for N ≤ 5 and extended to N = 6, 7, 8, yielding the claimed first complete tabulation of more than 33,000 knot and link types under the stated conventions, together with proved structural facts including a parity statement on the a-span and a sharp upper bound of N-1 on bigon faces.

Significance. If the completeness claim holds, the work supplies the first exhaustive dataset at these crossing numbers and a self-contained computational model that also yields proved theorems on map properties. This advances enumeration in topological graph theory and provides a reference collection plus falsifiable conjectures (e.g., 4N bound on bracket span) that can be tested against the generated data.

major comments (1)
  1. [validation and extension section] The section describing validation and extension: validation is reported only against published results for N ≤ 5; the central claim that the (α, σ) canonical-representative enumeration, crossing assignments, and local reductions produce every distinct diagram exactly once for N = 6, 7, 8 therefore rests on the unexamined correctness of those steps at higher crossing numbers. This directly supports both the >33,000-type count and the assertion of completeness.
minor comments (2)
  1. [structural facts] The proved upper bound N-1 on bigon faces is stated as sharp; an explicit proposition or theorem number together with the key step in its proof would allow readers to verify the argument without reconstructing the entire permutation model.
  2. [enumeration method] Notation for the action of the mapping-class group on the permutation pairs could be clarified with a short diagram or pseudocode fragment showing how unsensed representatives are selected.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful review and the opportunity to address the concern regarding validation of the enumeration procedure at higher crossing numbers. We respond to the major comment below.

read point-by-point responses

  1. Referee: [validation and extension section] The section describing validation and extension: validation is reported only against published results for N ≤ 5; the central claim that the (α, σ) canonical-representative enumeration, crossing assignments, and local reductions produce every distinct diagram exactly once for N = 6, 7, 8 therefore rests on the unexamined correctness of those steps at higher crossing numbers. This directly supports both the >33,000-type count and the assertion of completeness.

    Authors: The completeness and absence of duplication in the enumeration follow from the theoretical construction of canonical representatives for all cellular 4-regular torus maps encoded by permutation pairs (α, σ), as proved in Sections 2 and 3 for arbitrary crossing number N. This construction is independent of the specific value of N. The reported validation against published results for N ≤ 5 verifies that the implementation (including crossing assignments and local reductions) correctly realizes the theoretical procedure. Because the same algorithm and code are applied without modification to N = 6, 7, 8, the exhaustiveness guarantees carry over directly. No independent tabulations exist for these higher values, so further empirical cross-checks are not possible. The >33,000-type count and completeness assertion are therefore supported by the combination of the N-independent proof and the implementation check at small N. revision: no

Circularity Check

0 steps flagged

No circularity: direct algorithmic enumeration of maps via permutation pairs with external validation on small cases

full rationale

The paper's core is an exhaustive generation algorithm encoding cellular 4-regular torus projections by permutation pairs (alpha, sigma), enumerating unsensed classes via canonical representatives, then applying crossing assignments and reductions. This is a computational procedure grounded in standard map theory, not a derivation that defines quantities in terms of themselves or renames fitted results as predictions. Structural facts (parity of a-span, N-1 bigon bound) are stated as proved outputs of the enumeration. Validation against independent published classifications for N<=5 supplies an external benchmark rather than a self-citation chain that bears the completeness claim for N=6-8. No load-bearing step reduces by construction to its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on the standard theory of maps on surfaces and permutation representations of 4-regular graphs; no free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)
  • standard math Cellular 4-regular maps on the torus are faithfully encoded by pairs of permutations (alpha, sigma) satisfying the usual cycle and fixed-point conditions for a surface embedding.
    Invoked in the opening description of the encoding method.
  • domain assumption Unsensed equivalence classes of diagrams can be enumerated without duplication by selecting canonical representatives under the action of the mapping class group or dihedral symmetries.
    Central to the claim of exhaustive generation without duplication.

pith-pipeline@v0.9.1-grok · 5771 in / 1523 out tokens · 21650 ms · 2026-06-27T05:04:09.001903+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

19 extracted references · 15 canonical work pages

  1. [1]

    S. V . Matveev A. A. Akimova & V . V . Tarkaev (2020): Classification of prime links in the thick- ened torus having crossing number 5 . J. of Knot Theory and Its Ramifications 29(03), p. 2050012, doi:10.1142/S0218216520500121

    work page doi:10.1142/s0218216520500121 2020

  2. [2]

    A. A. Akimova & S. Matveev (2012): Classification of knots in T x I with at most 4 crossings . arXiv: Geometric Topology. Available at https://api.semanticscholar.org/CorpusID:119621553

    2012

  3. [3]

    A. A. Akimova & S. V . Matveev (2014): Classification of genus 1 virtual knots having at most five classical crossings. J. of Knot Theory and Its Ramifications 23(06), p. 1450031, doi:10.1142/S021821651450031X

    work page doi:10.1142/s021821651450031x 2014

  4. [4]

    Brinkmann (2024): Generating Maps on Oriented Surfaces Using the Homomorphism Principle

    G. Brinkmann (2024): Generating Maps on Oriented Surfaces Using the Homomorphism Principle. Discrete & Computational Geometry, doi:10.1007/s00454-025-00734-5

    work page doi:10.1007/s00454-025-00734-5 2024

  5. [5]

    Brinkmann & B

    G. Brinkmann & B. D. McKay (2007): Fast generation of planar graphs. Match-communications in Mathe- matical and in Computer Chemistry 58, pp. 323–357. Available at https://api.semanticscholar.org/ CorpusID:116425311

    2007

  6. [6]

    Z.-C. Gao E. A. Bender & L. B. Richmond (1992): Submaps of maps. I. General 0-1 laws. J. Comb. Theory B 55(1), pp. 104–117, doi:10.1016/0095-8956(92)90034-U

    work page doi:10.1016/0095-8956(92)90034-u 1992

  7. [7]

    Thistlethwaite J

    M. Thistlethwaite J. Hoste & J. Weeks (1998): The first 1,701,936 knots. The Mathematical Intelligencer 20, pp. 33–48, doi:10.1007/BF03025227

    work page doi:10.1007/bf03025227 1998

  8. [8]

    L. H. Kauffman (1999): Virtual Knot Theory . Eur. J. Comb. 20(7), pp. 663–691, doi:10.1006/EUJC.1999.0314

    work page doi:10.1006/eujc.1999.0314 1999

  9. [9]

    Krasko & A

    E. Krasko & A. Omelchenko (2017): Enumeration of 4-regular one-face maps. European J. of Combinatorics 62, pp. 167–177, doi:10.1016/j.ejc.2016.12.004. 138 Exhaustive Generation of Genus-One Diagrams via Maps on the Torus

    work page doi:10.1016/j.ejc.2016.12.004 2017

  10. [10]

    Krasko & A

    E. Krasko & A. Omelchenko (2019): Enumeration of r-regular maps on the torus. Part I: . Discrete Math. 342(2), pp. 584–599, doi:10.1016/j.disc.2018.07.013

    work page doi:10.1016/j.disc.2018.07.013 2019

  11. [11]

    Krasko & A

    E. Krasko & A. Omelchenko (2019): Enumeration of r-regular maps on the torus. Part II: Unsensed maps. Discrete Math. 342(2), pp. 600–614, doi:10.1016/j.disc.2018.09.004

    work page doi:10.1016/j.disc.2018.09.004 2019

  12. [12]

    Krasko & A

    E. Krasko & A. Omelchenko (2021): Enumeration of rooted 4-regular maps without planar loops. Discrete Math. 344(8), p. 112442, doi:10.1016/j.disc.2021.112442

    work page doi:10.1016/j.disc.2021.112442 2021

  13. [13]

    Kuperberg (1999): What is a virtual link? Algebr

    G. Kuperberg (1999): What is a virtual link? Algebr. Geom. Topol. 3, pp. 587–591, doi:10.2140/agt.2003.3.587

    work page doi:10.2140/agt.2003.3.587 1999

  14. [14]

    Omelchenko (2026): Torus_Maps: Reference implementation and datasets for genus-one projection and diagram enumeration on the torus

    A. Omelchenko (2026): Torus_Maps: Reference implementation and datasets for genus-one projection and diagram enumeration on the torus. Available at https://github.com/avo-travel/Torus_Maps

    2026

  15. [15]

    V . R. Meshkov S. A. Grishanov & A. V . Omelchenko (2007): Kauffman-type polynomial invariants for doubly periodic structures . Journal of Knot Theory and Its Ramifications 16(06), pp. 779–788, doi:10.1142/S021821650700549X

    work page doi:10.1142/s021821650700549x 2007

  16. [16]

    Meshkov S

    V . Meshkov S. Grishanov & A. Omelchenko (2009): A Topological Study of Textile Structures. Part I: An Introduction to Topological Methods. Textile Res. J. 79, pp. 702 – 713, doi:10.1177/0040517508095600

    work page doi:10.1177/0040517508095600 2009

  17. [17]

    Meshkov S

    V . Meshkov S. Grishanov & A. Omelchenko (2009): A Topological Study of Textile Structures. Part II: Topological Invariants in Application to Textile Structures . Textile Res. J. 79, pp. 822–836, doi:10.1177/0040517508096221

    work page doi:10.1177/0040517508096221 2009

  18. [18]

    Sergei S. K. Lando & A. K. Zvonkin (2004): Graphs on Surfaces and Their Applications . Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/978-3-540-38361-1_1

    work page doi:10.1007/978-3-540-38361-1_1 2004

  19. [19]

    P. G. Tait (1877): On knots I, II, III. Trans. Roy. Soc. Edinburgh28, pp. 35–79