pith. sign in

arxiv: 2504.10517 · v2 · submitted 2025-04-10 · 🧮 math.GT

The Plain Sphere Number of a Link

Ryan Blair , Alexandra Kjuchukova , Ella Pfaff This is my paper

Pith reviewed 2026-05-22 20:02 UTC · model grok-4.3

classification 🧮 math.GT
keywords linkbridge numberfundamental groupmeridional presentationWirtinger presentationtwo-sphereslink complementdiagram
0
0 comments X

The pith

The smallest number of generators over a restricted class of meridional presentations for a link group equals the link's bridge number.

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

The paper studies presentations of the fundamental group of a link complement in which each relation is witnessed by an embedded two-sphere that can appear together with the others inside one fixed diagram of the link. Wirtinger presentations form a special case inside this class. The authors prove that the minimal number of generators required across all such presentations is exactly the bridge number of the link. A reader would care because this supplies an algebraic reading of a geometric invariant while staying inside diagram-respecting presentations.

Core claim

We prove that the smallest number of generators of π₁(S³∖L) over all such presentations equals the bridge number of L.

What carries the argument

Meridional presentations for π₁(S³∖L) whose relations are witnessed by embedded two-spheres that can be realized simultaneously in a fixed diagram of L

If this is right

  • The bridge number is realized as the generator count in this restricted algebraic setting.
  • Any presentation in the class, including the Wirtinger presentation, requires at least as many generators as the bridge number.
  • Bridge number can be bounded from above by exhibiting one diagram whose sphere-witnessed presentation achieves that generator count.
  • The result unifies an algebraic presentation count with a geometric link measure inside the same diagram.

Where Pith is reading between the lines

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

  • Algorithms that enumerate presentations respecting a single diagram might compute or approximate bridge numbers directly.
  • The same sphere-witnessed restriction could be applied to other invariants such as tunnel number or Heegaard genus to seek similar equalities.
  • If the class of presentations can be generated mechanically from a diagram, the equality supplies a new computational route to bridge number.

Load-bearing premise

Every link admits at least one diagram in which the minimal generator count from these sphere-witnessed presentations matches the geometric bridge number without extra diagram changes.

What would settle it

A concrete link for which the fewest generators needed in any simultaneously embeddable sphere presentation differs from its independently computed bridge number.

Figures

Figures reproduced from arXiv: 2504.10517 by Alexandra Kjuchukova, Ella Pfaff, Ryan Blair.

Figure 1
Figure 1. Figure 1: Possible plain sphere coloring moves at stage i of a coloring process which do not reduce to sequences of Wirtinger moves in the given tangle diagrams. A is the move used in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A region in the plane containing a link diagram at stage i of the coloring process. Subarcs of the diagram are represented by short line segments, and loops in L are represented by circles and arcs. The loop Li , which colors the strand containing the point x, can be replaced with the loop L ∗ i (dashed line), which is disjoint from all other loops in L and represents a valid plain sphere coloring move at … view at source ↗
Figure 3
Figure 3. Figure 3: Exactly one uncolored strand s intersects the loop Li ∈ L at stage i. Proof. Since ρ(D) = n, there exists a coloring sequence L for D starting from n seeds. Using Lemma 3.1, we can assume that the circles contained in L are disjoint, possibly after modification. Let Li be an innermost loop in L. This means that Li bounds a disk Ei whose interior is disjoint from L. As before, we consider Li at stage i of t… view at source ↗
Figure 4
Figure 4. Figure 4: An isotopy to ensure no seed strand s is contained entirely in the interior of any disk Ei in the plane with ∂(Ei) = Li ∈ L. After a sequence of m Reidemeister II moves, 2m-many Wirtinger coloring loops are added in the appropriate positions to sequence L in order to obtain L ′ . loops of L. For n > 2, the definition is inductive in the natural way: a loop C is depth-n if disk G contains at least one depth… view at source ↗
Figure 5
Figure 5. Figure 5: An isotopy at stage i of the coloring process of a rational m-strand tangle supported in disk Ei with ∂(Ei) = Li . After isotopy, all strands that meet Ei can be colored using only Wirtinger moves, starting from 2m−1 colored strands which intersect Li . be valid. Repeating this procedure for each j ∈ {1, . . . , m} produces the desired coloring sequence for D1. In sum, after an isotopy supported in a neigh… view at source ↗
Figure 6
Figure 6. Figure 6: A partially colored minimal diagram D of the knot K = 14n1527 with β(K) = ρ(D) = 3 and ω(D) = 4. Seed strands are marked with dots. Colored strands are purple. At this stage of the coloring sequence, only Wirtinger moves have been performed, and no further Wirtinger moves are possible. The dotted circle L8 represents a loop coloring move. (The reader may find several alternative loop coloring moves.) After… view at source ↗
read the original abstract

Let $L$ be a link in $S^3$. We consider the class of meridional presentations for $\pi_1(S^3\backslash L)$ in which the relations are witnessed by embedded two-spheres which can be represented simultaneously in a fixed diagram of $L$, analogously to decomposition spheres studied by Cromwell, Menasco and others. Wirtinger relations are witnessed by such spheres and the Wirtinger presentation is a special case of the ones we study. We prove that the smallest number of generators of $\pi_1(S^3\backslash L)$ over all such presentations equals the bridge number of $L$.

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

2 major / 2 minor

Summary. The paper defines the plain sphere number of a link L as the minimal number of generators appearing in any meridional presentation of π₁(S³ ∖ L) whose relations are witnessed by a collection of embedded 2-spheres that can be realized simultaneously in one fixed diagram of L. It proves that this quantity equals the bridge number b(L), noting that the classical Wirtinger presentation is a special case realized by such spheres.

Significance. If correct, the result supplies a new diagram-based algebraic characterization of the bridge number, linking the minimal generator count in a restricted class of presentations (those admitting simultaneous sphere witnesses) to a classical geometric invariant. This extends ideas from Cromwell–Menasco decomposition spheres and could furnish new tools for studying presentations of link groups that respect diagram geometry.

major comments (2)
  1. [§3] §3 (proof of lower bound): the argument that any meridional presentation witnessed by simultaneously embeddable spheres in a diagram D must have at least b(D) generators does not explicitly address the possibility that a single sphere intersects multiple over- or under-passes, thereby imposing relations that identify generators across what would otherwise be distinct bridges. A concrete example or lemma ruling out such cross-bridge mergers is needed to establish that the generator count cannot drop below b(D).
  2. [Theorem 1.1] Theorem 1.1 (main equality): while the upper bound follows immediately from the Wirtinger presentation on a minimal bridge diagram, the lower bound requires showing that the restriction to simultaneously embeddable spheres does not allow stabilizations or non-minimal diagrams to produce presentations with fewer than b(L) generators. The manuscript should include a diagram-move argument or stabilization lemma that closes this gap.
minor comments (2)
  1. [§2] The definition of 'plain sphere' and the precise meaning of 'simultaneously embeddable' should be stated in a numbered definition before the main theorem.
  2. [Figures 2–4] Figure captions should explicitly label the spheres and indicate which meridians they bound.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments. We respond to each major comment below. The manuscript will be revised to incorporate additional explicit arguments and a lemma as outlined.

read point-by-point responses

  1. Referee: [§3] §3 (proof of lower bound): the argument that any meridional presentation witnessed by simultaneously embeddable spheres in a diagram D must have at least b(D) generators does not explicitly address the possibility that a single sphere intersects multiple over- or under-passes, thereby imposing relations that identify generators across what would otherwise be distinct bridges. A concrete example or lemma ruling out such cross-bridge mergers is needed to establish that the generator count cannot drop below b(D).

    Authors: The lower bound in §3 associates each generator with a distinct bridge arc of D via the meridional spheres. Because the spheres are simultaneously embedded and intersect the diagram only along meridians to the over- or under-passes, an embedded sphere cannot connect generators belonging to separate bridges without violating either the embedding condition or the meridional requirement. We will nevertheless add a short lemma that explicitly rules out cross-bridge mergers by analyzing possible intersection patterns with the projection, together with a concrete local picture showing why such a configuration is impossible. revision: partial

  2. Referee: [Theorem 1.1] Theorem 1.1 (main equality): while the upper bound follows immediately from the Wirtinger presentation on a minimal bridge diagram, the lower bound requires showing that the restriction to simultaneously embeddable spheres does not allow stabilizations or non-minimal diagrams to produce presentations with fewer than b(L) generators. The manuscript should include a diagram-move argument or stabilization lemma that closes this gap.

    Authors: The lower bound proved in §3 applies to every diagram D: any sphere-witnessed meridional presentation arising from D has at least b(D) generators. Since b(D) ≥ b(L) for every diagram, no such presentation—whether obtained from a minimal diagram, a stabilized diagram, or any other diagram—can have fewer than b(L) generators. To make this explicit we will insert a brief stabilization lemma that tracks how Reidemeister moves and bridge stabilizations affect the set of simultaneously embeddable spheres and confirms that the generator count remains at least b(D) (hence at least b(L)). revision: yes

Circularity Check

0 steps flagged

No circularity: equality proved via independent geometric constructions

full rationale

The paper introduces the plain sphere number as the minimal generator count over a restricted class of meridional presentations of the link complement whose relations are realized by simultaneously embeddable 2-spheres in a fixed diagram. It then proves this quantity equals the independently defined bridge number of L. The argument proceeds by showing that Wirtinger presentations achieve the bridge number and that no such sphere-witnessed presentation can have fewer generators, using diagram geometry and embedding properties rather than any self-referential equation, fitted parameter renamed as prediction, or load-bearing self-citation. The derivation is therefore self-contained against external geometric benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The result relies on standard facts about fundamental groups of link complements, properties of embedded spheres in S^3, and the definition of bridge number. No free parameters or invented entities are introduced beyond the new definition of the plain sphere number itself.

axioms (2)
  • domain assumption Fundamental group presentations of link complements can be realized by embedded spheres in a fixed diagram.
    Invoked in the definition of the class of meridional presentations studied.
  • domain assumption Wirtinger presentations are included as a special case of the sphere-witnessed presentations.
    Stated explicitly in the abstract to connect to classical presentations.
invented entities (1)
  • Plain sphere number no independent evidence
    purpose: Minimal generator count over the restricted class of meridional presentations.
    Newly defined invariant whose equality to bridge number is the main result.

pith-pipeline@v0.9.0 · 5626 in / 1508 out tokens · 40431 ms · 2026-05-22T20:02:37.824562+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

21 extracted references · 21 canonical work pages

  1. [1]

    Baader and A

    S. Baader and A. Kjuchukova. Symmetric quotients of knot groups and a filtration of the Gordian graph.Math- ematical Proceedings of the Cambridge Philosophical Society, 169:141–148, 2020

    work page 2020

  2. [2]

    Coxeter groups and meridional rank of links.Mathe- matische Annalen, 379:1533–1551, 2021

    Sebastian Baader, Ryan Blair, and Alexandra Kjuchukova. Coxeter groups and meridional rank of links.Mathe- matische Annalen, 379:1533–1551, 2021

    work page 2021

  3. [3]

    The bridge number of arborescent links with many twigs.Algebraic & Geometric Topology, 23(1):75–85, 2023

    Sebastian Baader, Ryan Blair, Alexandra Kjuchukova, and Filip Misev. The bridge number of arborescent links with many twigs.Algebraic & Geometric Topology, 23(1):75–85, 2023

    work page 2023

  4. [4]

    Blair, A

    R. Blair, A. Kjuchukova, and M. Ozawa. The incompatibility of crossing number and bridge number for knot diagrams.Discrete Mathematics, 342(7):1966–1978, 2019

    work page 1966

  5. [5]

    Wirtinger systems of generators of knot groups.Com- munications in Analysis and Geometry, 28(2):243–262, 2020

    R Blair, A Kjuchukova, R Velazquez, and P Villanueva. Wirtinger systems of generators of knot groups.Com- munications in Analysis and Geometry, 28(2):243–262, 2020

    work page 2020

  6. [6]

    Boileau, E

    M. Boileau, E. Dutra, Y. Jang, and R. Weidmann. Meridional rank of knots whose exterior is a graph manifold. Topology and its Applications, 228:458–485, 2017

    work page 2017

  7. [7]

    Boileau and H

    M. Boileau and H. Zieschang. Nombre de ponts et g´ en´ erateurs m´ eridiens des entrelacs de Montesinos.Comment. Math. Helv., 60(1):270–279, 1985

    work page 1985

  8. [8]

    Boileau and B

    M. Boileau and B. Zimmermann. Theπ-orbifold group of a link.Math. Z., 200(2):187–208, 1989

    work page 1989

  9. [9]

    Links covering knots with two bridges.Kobe Journal of Mathematics, 5:209–220, 1988

    Gerhard Burde. Links covering knots with two bridges.Kobe Journal of Mathematics, 5:209–220, 1988

    work page 1988

  10. [10]

    C. R. Cornwell and D. R. Hemminger. Augmentation rank of satellites with braid pattern.Communications in Analysis and Geometry, 24(5):939–967, 2016

    work page 2016

  11. [11]

    Cornwell

    Christopher R. Cornwell. Knot contact homology and representations of knot groups.J. Topol., 7(4):1221–1242, 2014

    work page 2014

  12. [12]

    Positive braids are visually prime.Proceedings of the London Mathematical Society, 3(2):384– 424, 1993

    Peter R Cromwell. Positive braids are visually prime.Proceedings of the London Mathematical Society, 3(2):384– 424, 1993

    work page 1993

  13. [13]

    Dunfield, Matthias Goerner, and Jeffrey R

    Marc Culler, Nathan M. Dunfield, Matthias Goerner, and Jeffrey R. Weeks. SnapPy, a computer program for studying the geometry and topology of 3-manifolds. Available athttp://snappy.computop.org(01/04/2025)

    work page 2025

  14. [14]

    Private communication, 2025

    Nathan Dunfield. Private communication, 2025

    work page 2025

  15. [15]

    Meridional rank of whitehead doubles.arXiv preprint arXiv:2212.13081, 2022

    Ederson Dutra. Meridional rank of whitehead doubles.arXiv preprint arXiv:2212.13081, 2022

    work page arXiv 2022

  16. [16]

    Homogeneous braids are visually prime.arXiv preprint arXiv:2408.15730, 2024

    Peter Feller, Lukas Lewark, and Miguel Orbegozo Rodriguez. Homogeneous braids are visually prime.arXiv preprint arXiv:2408.15730, 2024

    work page arXiv 2024

  17. [17]

    Meridional rank and bridge number of knotted 2-spheres.Canadian Journal of Mathematics, pages 1–18, 2024

    Jason Joseph and Puttipong Pongtanapaisan. Meridional rank and bridge number of knotted 2-spheres.Canadian Journal of Mathematics, pages 1–18, 2024

    work page 2024

  18. [18]

    R. Kirby. Problems in low-dimensional topology. In R. Kirby, editor,Proceedings of Georgia Topology Conference, Part 2, 1995

    work page 1995

  19. [19]

    Closed incompressible surfaces in alternating knot and link complements.Topology, 23(1):37– 44, 1984

    William Menasco. Closed incompressible surfaces in alternating knot and link complements.Topology, 23(1):37– 44, 1984

    work page 1984

  20. [20]

    Meridional generators and plat presentations of torus links.Journal of the London Mathematical Society, 2(3):551–562, 1987

    Markus Rost and Heiner Zieschang. Meridional generators and plat presentations of torus links.Journal of the London Mathematical Society, 2(3):551–562, 1987

    work page 1987

  21. [21]

    Additivity of bridge numbers of knots.Math

    Jennifer Schultens. Additivity of bridge numbers of knots.Math. Proc. Cambridge Philos. Soc., 135(3):539–544, 2003

    work page 2003