arxiv: 2604.27213 · v1 · submitted 2026-04-29 · 🧮 math.GT · math.SG

Recognition: unknown

Hard Legendrian unknots

Joseph Breen , Austin Christian , Angela Wu

Authors on Pith no claims yet

Pith reviewed 2026-05-07 10:21 UTC · model grok-4.3

classification 🧮 math.GT math.SG

keywords Legendrian unknotsnormal rulingsReidemeister hardnessThurston-Bennequin numberfront projectionswritheunknot diagramsLegendrian fronts

0 comments

The pith

Normal rulings obstruct many hard unknot diagrams from being realized as maximal tb Legendrian fronts.

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

The paper starts the study of Reidemeister hardness specifically for Legendrian unknot front projections. It applies normal rulings to rule out several infinite families of hard unknot diagrams, plus 1.7 million of the 2.6 million diagrams from an earlier computational survey, as possible max-tb Legendrian fronts. The authors also produce infinitely many smoothly hard max-tb unknot diagrams and establish lower bounds on the writhe these diagrams must have.

Core claim

Using normal rulings, we obstruct several infinite families of hard unknot diagrams from being drawn with max-tb unknot fronts, along with 1.7 million of the 2.6 million hard unknot diagrams studied in the cited work. We construct infinitely many smoothly hard max-tb unknot diagrams and bound their minimum possible writhe. With respect to these bounds, our constructions are conjecturally sharp.

What carries the argument

Normal rulings on Legendrian front diagrams, serving as a combinatorial obstruction to a diagram realizing the maximal Thurston-Bennequin number for the unknot.

If this is right

Several infinite families of hard unknot diagrams are provably unrealizable as max-tb Legendrian fronts.
The majority of the 2.6 million computationally enumerated hard unknot diagrams are likewise obstructed.
There exist infinitely many unknot diagrams that are both smoothly hard and max-tb Legendrian.
Any smoothly hard max-tb unknot diagram must satisfy explicit lower bounds on its writhe.

Where Pith is reading between the lines

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

The Legendrian category imposes stricter constraints on diagram hardness than the smooth category alone.
Existing enumerations of hard unknots may require re-examination for which ones admit Legendrian max-tb realizations.
The conjecturally sharp writhe bounds point toward specific infinite families that could achieve the minimal possible writhe.
This framework could be applied to study hardness for other Legendrian knots beyond the unknot.

Load-bearing premise

The existence of a normal ruling in a diagram is incompatible with that diagram being the front projection of a maximal tb Legendrian unknot.

What would settle it

A concrete max-tb Legendrian unknot front projection that nevertheless admits a normal ruling.

read the original abstract

We initiate the study of Reidemeister hardness of Legendrian unknot front projections. Using normal rulings, we obstruct several infinite families of hard unknot diagrams from being drawn with max-tb unknot fronts, along with 1.7 million of the 2.6 million hard unknot diagrams studied in \cite{applebaum2024unknottingnumberhardunknot}. We construct infinitely many smoothly hard max-tb unknot diagrams, and bound their minimum possible writhe. With respect to these bounds, our constructions are conjecturally sharp.

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.

Desk Editor's Note private letter to a colleague

The paper applies normal rulings to obstruct max-tb Legendrian fronts for 1.7 million hard unknot diagrams plus infinite families, while constructing infinite hard max-tb examples and giving writhe bounds.

read the letter

The main takeaway is that this paper takes the existing list of hard unknot diagrams and checks which ones can appear as Legendrian front projections with maximal Thurston-Bennequin number. Normal rulings block most of them, including several infinite families and 1.7 million of the 2.6 million diagrams from the cited work. They also produce infinitely many hard diagrams that do admit such max-tb fronts and bound the possible writhe from below, with a conjecture that the bounds are sharp. This is new because prior hardness results stayed in the smooth category and did not address Legendrian realizations or these specific counts and families. The approach works because a max-tb unknot front must admit a normal ruling, so the absence of one gives a clean obstruction. The constructions appear to modify known hard diagrams in controlled ways that preserve both hardness and the Legendrian max-tb property. The paper does well by staying concrete and computational rather than claiming broad new invariants. It uses a standard tool in a direct way and supplies explicit infinite families instead of just finite checks. The writhe bounds add a quantitative angle that could be useful for further work. The softer spots are around the computational scale and the smooth-to-Legendrian transfer. Checking rulings across 1.7 million diagrams is a large task, so the reliability depends on the verification method being free of edge-case errors. The carry-over of smooth hardness also assumes that Legendrian-specific moves do not create unexpected equivalences, which is plausible but could use a short explicit argument. These are not fatal but would benefit from referee scrutiny on the data handling. This paper is for people already following hard unknots or Legendrian front projections. A reader in geometric topology who wants concrete extensions of the Applebaum et al. results will get value from the families and the obstruction counts. It deserves peer review because the claims are specific, the logic is consistent with known facts about rulings, and the results are testable without hidden parameters or circularity.

Referee Report

0 major / 3 minor

Summary. The manuscript initiates the study of Reidemeister hardness of Legendrian unknot front projections. Using normal rulings, it obstructs several infinite families of hard unknot diagrams from being drawn with max-tb unknot fronts, along with 1.7 million of the 2.6 million hard unknot diagrams studied in the cited work. It constructs infinitely many smoothly hard max-tb unknot diagrams and bounds their minimum possible writhe, conjecturing these bounds to be sharp.

Significance. If the results hold, this work opens a new direction connecting combinatorial diagram hardness to Legendrian invariants. The obstructions via normal rulings (a standard tool whose vanishing correctly rules out max-tb unknots) for infinite families and a large computational sample, together with explicit constructions of smoothly hard max-tb fronts and writhe bounds, provide concrete examples and falsifiable predictions. The conjectural sharpness of the bounds is a strength that invites further verification.

minor comments (3)

The abstract states the obstruction of 1.7 million diagrams but does not indicate the computational method or verification procedure used to obtain this count; a brief description in §1 or a dedicated subsection would improve transparency.
The term 'smoothly hard' is used in the abstract and constructions without an explicit definition or reference to its precise meaning in the Legendrian context; adding a short definition or citation early in the introduction would aid readability.
Figure captions and any tables enumerating obstructed families should explicitly reference the normal ruling invariant applied, to make the obstruction mechanism immediately visible without cross-referencing the text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary and recommendation of minor revision. The report accurately captures the manuscript's use of normal rulings to obstruct hard unknot diagrams from realizing max-tb Legendrian fronts, the computational obstructions for 1.7 million diagrams, and the constructions of infinitely many smoothly hard max-tb unknot fronts together with writhe bounds. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper applies the standard combinatorial invariant of normal rulings to obstruct certain hard unknot diagrams from realizing max-tb Legendrian fronts, cites an external enumeration of 2.6 million diagrams from Applebaum et al. (2024), and supplies explicit constructions of infinitely many smoothly hard max-tb fronts together with writhe bounds. No equation or claim reduces by definition to its own inputs, no fitted parameter is relabeled as a prediction, and no load-bearing premise rests on a self-citation chain. The central obstruction and construction steps are self-contained against external benchmarks and known properties of rulings for unknots.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available, so no specific free parameters, axioms, or invented entities can be extracted; the work appears to rest on standard definitions from contact geometry and the external enumeration of hard diagrams.

pith-pipeline@v0.9.0 · 5375 in / 1198 out tokens · 47517 ms · 2026-05-07T10:21:16.598391+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

9 extracted references · 3 canonical work pages

[1]

[Ada94] C.C

[ABD+24] Taylor Applebaum, Sam Blackwell, Alex Davies, Thomas Edlich, András Juhász, Marc Lackenby, Nenad Tomašev, and Daniel Zheng,The unknotting number, hard unknot diagrams, and reinforcement learning, 2024, arXiv:2409.09032. [Ada94] C.C. Adams,The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots, W.H. Freeman and Company,

work page arXiv 2024
[2]

Burton, Hsien-Chih Chang, Maarten Löffler, Arnaud de Mesmay Clément Maria, Saul Schleimer, Eric Sedgwick, and Jonathan Spreer,Hard diagrams of the unknot, Exp

[BCL+24] Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler, Arnaud de Mesmay Clément Maria, Saul Schleimer, Eric Sedgwick, and Jonathan Spreer,Hard diagrams of the unknot, Exp. Math.33(2024), no. 3, 482–500. [Ben83] Daniel Bennequin,Entrelacements et equations de Pfaff, Astérisque107(1983), 87–161. [BM92] Joan S. Birman and William W. Menasco,Studying...

work page arXiv 2024
[3]

Math.150(2002), no

[Che02] Yuri Chekanov,Differential algebra of Legendrian links, Invent. Math.150(2002), no. 3, 441–483. HARD LEGENDRIAN UNKNOTS 31 [CN13] Wutichai Chongchitmate and Lenhard Ng,An atlas of Legendrian knots, Exp. Math.22(2013), no. 1, 26–37. [CNS16] Christopher Cornwell, Lenhard Ng, and Steven Sivek,Obstructions to Lagrangian concordance, Algebr. Geom. Topo...

2002
[4]

[EHK12] Tobias Ekholm, Ko Honda, and Tamás Kálmán,Legendrian knots and exact Lagrangian cobordisms, J. Eur. Math. Soc. (JEMS)18(2012), 2627–2689. [Eli87] Yakov Eliashberg,A theorem on the structure of wave fronts and its application in symplectic topology, Funct. Anal. Its. Appl.21(1987), 227–232. [Eli92] ,Contact 3-manifolds twenty years since J. Martine...

2012
[5]

[Goe34] Lebrecht Goeritz,Bemerkungen zur knotentheorie, Abh. Math. Sem. Univ. Hamburg10(1934), no. 1, 201–210. [Gom98] Robert E Gompf,Handlebody construction of Stein surfaces, Ann. of Math. (1998), 619–693. [HK14] Allison Henrich and Louis H. Kauffman,Unknotting unknots, Amer. Math. Monthly121(2014), no. 5, 379–

1934
[6]

Lagarias,The number of Reidemeister moves needed for unknotting, J

[HL01] Joel Hass and Jeffrey C. Lagarias,The number of Reidemeister moves needed for unknotting, J. Amer. Math. Soc. 14(2001), no. 2, 399–428. [HN10] Joel Hass and Tahl Nowik,Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle, Discrete Comput. Geom.44(2010), no. 1, 91–95. MR 2639820 [KL11] Louis H. Kauffman and Sofia Lambropoul...

2001
[7]

of Math.182(2015), no

[Lac15] Marc Lackenby,A polynomial upper bound on Reidemeister moves, Ann. of Math.182(2015), no. 2, 491–564. [LdMS24] Corentin Lunel, Arnaud de Mesmay, and Jonathan Spreer,Hard diagrams of split links, 2024, arXiv:2412.03372. [Lev14] Caitlin Leverson,Augmentations and rulings of Legendrian links, J. Symplectic Geom.14(2014), 1089–1143. [Moh01] Klaus Mohn...

work page arXiv 2015
[8]

MR 3548477 [Rut06] Dan Rutherford,The Thurston-Bennequin number, Kauffman polynomial, and ruling invariants of a Legendrian link: The Fuchs conjecture and beyond, Int. Math. Res. Not. IMRN2006(2006), no. 9, Art. ID 78591,

2006
[9]

Sabloff,Augmentations and rulings of Legendrian knots, Int

[Sab05] Joshua M. Sabloff,Augmentations and rulings of Legendrian knots, Int. Math. Res. Not. IMRN2005(2005), no. 19, 1157–1180. [Ste09] Ian Stewart,Professor Stewart’s Cabinet of Mathematical Curiosities, Basic Books,

2005