pith. sign in

arxiv: 2606.23284 · v1 · pith:YKOLI7ZSnew · submitted 2026-06-22 · 🧮 math.GT

Fibredness of 3-manifolds is in NP

Filippo Baroni This is my paper

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

classification 🧮 math.GT
keywords 3-manifoldsfiberingNP complexitydecision problemstriangulationsorientable manifoldscircle fibrations
0
0 comments X

The pith

Deciding whether a compact orientable 3-manifold fibers over the circle lies in NP.

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

The paper shows that fibredness over the circle for compact orientable 3-manifolds can be certified by a witness that a polynomial-time algorithm can check. The manifold is assumed given by a finite combinatorial presentation such as a triangulation. A reader would care because this places an important topological recognition problem inside a standard complexity class, so yes-instances have short proofs. The argument supplies an explicit certificate construction that works whenever the manifold does fiber.

Core claim

We show that the problem of deciding whether a compact orientable 3-manifold fibres over the circle lies in the complexity class NP.

What carries the argument

A polynomial-time verifiable certificate for fibredness constructed from the manifold's finite combinatorial presentation.

If this is right

  • Fibredness becomes an NP property under standard finite presentations of 3-manifolds.
  • Yes-instances of the decision problem possess short, efficiently checkable proofs.
  • The result supplies a concrete upper bound on the complexity of recognizing fibered 3-manifolds.
  • The same certificate technique applies uniformly to any triangulation that admits a fibration.

Where Pith is reading between the lines

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

  • The certificate may be usable as a practical filter inside existing 3-manifold software before running heavier algorithms.
  • Related recognition problems, such as whether a knot complement fibers, inherit an NP certificate under the same presentation model.
  • If an efficient NP oracle for fibredness becomes available, it could interact with other NP-complete problems in low-dimensional topology.

Load-bearing premise

The manifold is supplied by a finite combinatorial description such as a triangulation from which a short certificate can be built whenever fibredness holds.

What would settle it

A triangulation of a compact orientable 3-manifold that fibers over the circle yet admits no certificate of polynomial size verifiable in polynomial time.

Figures

Figures reproduced from arXiv: 2606.23284 by Filippo Baroni.

Figure 2
Figure 2. Figure 2: a [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 2
Figure 2. Figure 2 [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 2
Figure 2. Figure 2: a [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 2
Figure 2. Figure 2: b [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 2
Figure 2. Figure 2 [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 2
Figure 2. Figure 2: b [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: a [PITH_FULL_IMAGE:figures/full_fig_p018_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: b [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: a [PITH_FULL_IMAGE:figures/full_fig_p021_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: c [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p023_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: a [PITH_FULL_IMAGE:figures/full_fig_p026_3.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p027_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: a [PITH_FULL_IMAGE:figures/full_fig_p028_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: b [PITH_FULL_IMAGE:figures/full_fig_p029_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: c [PITH_FULL_IMAGE:figures/full_fig_p030_3.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p031_4.png] view at source ↗
Figure 4
Figure 4. Figure 4: a [PITH_FULL_IMAGE:figures/full_fig_p032_4.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p033_4.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p035_4.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p036_4.png] view at source ↗
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p037_4.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p037_3.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p038_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: a [PITH_FULL_IMAGE:figures/full_fig_p044_4.png] view at source ↗
Figure 2
Figure 2. Figure 2: b [PITH_FULL_IMAGE:figures/full_fig_p048_2.png] view at source ↗
Figure 5
Figure 5. Figure 5: a [PITH_FULL_IMAGE:figures/full_fig_p053_5.png] view at source ↗
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p054_5.png] view at source ↗
read the original abstract

We show that the problem of deciding whether a compact orientable 3-manifold fibres over the circle lies in the complexity class NP.

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

0 major / 2 minor

Summary. The paper claims that the decision problem of whether a compact orientable 3-manifold fibres over the circle lies in NP. Given a finite combinatorial presentation such as a triangulation, the authors exhibit an explicit polynomial-size certificate for fibredness together with a polynomial-time verification procedure.

Significance. If the certificate construction and verification hold, this is a significant result in computational 3-manifold topology. It supplies a direct, non-circular upper bound on the complexity of a fundamental topological property and includes an explicit, verifiable certificate, which is a strength for potential implementation and further algorithmic work.

minor comments (2)
  1. [Abstract] The abstract is concise but could briefly indicate the form of the certificate to help readers assess the result at a glance.
  2. [Introduction] Clarify the precise encoding of the input manifold (e.g., triangulation size and how it relates to the certificate size) in the introduction or §1.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the result and for recommending minor revision. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The manuscript establishes membership in NP by exhibiting an explicit polynomial-size certificate (a combinatorial object derived from the triangulation) together with a polynomial-time verification procedure. No step reduces a claimed prediction or uniqueness result to a fitted parameter, self-citation, or definitional tautology; the argument relies on standard 3-manifold topology and complexity definitions that remain independent of the target statement. The derivation is therefore self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no information on free parameters, axioms, or invented entities.

pith-pipeline@v0.9.1-grok · 5521 in / 852 out tokens · 21834 ms · 2026-06-26T06:04:54.537760+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

  1. [1]

    The Virtual Haken Conjecture

    Ian Agol. “The Virtual Haken Conjecture”. In:Doc. Math.18 (2013), pp. 1045–1087

    2013

  2. [2]

    The Computational Complex- ity of Knot Genus and Spanning Area

    Ian Agol, Joel Hass, and William Thurston. “The Computational Complex- ity of Knot Genus and Spanning Area”. In:Trans. Amer. Math. Soc.358.9 (2006), pp. 3821–3850

    2006

  3. [3]

    Cambridge University Press, Cambridge, 2009

    Sanjeev Arora and Boaz Barak.Computational Complexity. Cambridge University Press, Cambridge, 2009. xxiv+579. 55

    2009

  4. [4]

    Certifying Hyperbolicity of Fibred 3-Manifolds

    Filippo Baroni. “Certifying Hyperbolicity of Fibred 3-Manifolds”. PhD thesis. University of Oxford, 2025

    2025

  5. [5]

    Certifying Hyperbolicity of Fibred 3-Manifolds

    Filippo Baroni. “Certifying Hyperbolicity of Fibred 3-Manifolds”. In pre- paration

  6. [6]

    Upper Bounds for the Complexity of Torus Knot Complements

    Evgeny Fominykh and Bert Wiest. “Upper Bounds for the Complexity of Torus Knot Complements”. In:J. Knot Theory Ramifications22.10 (2013)

    2013

  7. [7]

    Foliations and the Topology of 3-Manifolds

    David Gabai. “Foliations and the Topology of 3-Manifolds”. In:J. Differ- ential Geom.18.3 (1983), pp. 445–503

    1983

  8. [8]

    The Computational Complexity of Knot and Link Problems

    Joel Hass, Jeffrey C. Lagarias, and Nicholas Pippenger. “The Computational Complexity of Knot and Link Problems”. In:J. ACM46.2 (1999), pp. 185– 211

    1999

  9. [9]

    The Computational Complexity of Basic Decision Problems in 3-Dimensional Topology

    S. V. Ivanov. “The Computational Complexity of Basic Decision Problems in 3-Dimensional Topology”. In:Geom. Dedicata131 (2008), pp. 1–26

    2008

  10. [10]

    Klaus Johannson.Homotopy Equivalences of 3-Manifolds with Boundaries. Vol. 761. Lecture Notes in Mathematics. Springer, Berlin, 1979. ii+303

    1979

  11. [11]

    The Efficient Certification of Knottedness and Thurston Norm

    Marc Lackenby. “The Efficient Certification of Knottedness and Thurston Norm”. In:Adv. Math.387 (2021), Paper No. 107796, 142

    2021

  12. [12]

    The Triangulation Complexity of Fibred 3-Manifolds

    Marc Lackenby and Jessica S. Purcell. “The Triangulation Complexity of Fibred 3-Manifolds”. In:Geom. Topol.28.4 (2024), pp. 1727–1828

    2024

  13. [13]

    Recognising Elliptic Manifolds

    Marc Lackenby and Saul Schleimer. “Recognising Elliptic Manifolds”. In: Comment. Math. Helv.101.1 (2026), pp. 1–45

    2026

  14. [14]

    Bruno Martelli.An Introduction to Geometric Topology. 2023

    2023

  15. [15]

    Second edition

    Sergei Matveev.Algorithmic Topology and Classification of 3-Manifolds. Second edition. Vol. 9. Algorithms and Computation in Mathematics. Springer, Berlin, 2007. xiv+492

    2007

  16. [16]

    Sphere Recognition Lies in NP

    Saul Schleimer. “Sphere Recognition Lies in NP”. In:Low-Dimensional and Symplectic Topology. Vol. 82. Proc. Sympos. Pure Math. Amer. Math. Soc., Providence, RI, 2011, pp. 183–213

    2011

  17. [17]

    Almost Normal Heegaard Splittings

    Saul David Schleimer. “Almost Normal Heegaard Splittings”. PhD thesis. University of California, Berkeley, 2001

    2001

  18. [18]

    On Fibering Certain 3-Manifolds

    John Stallings. “On Fibering Certain 3-Manifolds”. In:Topology of 3- Manifolds and Related Topics (Proc. The Univ. of Georgia Institute, 1961). Prentice-Hall, Inc., Englewood Cliffs, NJ, 1961, pp. 95–100

    1961

  19. [19]

    A Norm for the Homology of 3-Manifolds

    William P. Thurston. “A Norm for the Homology of 3-Manifolds”. In:Mem. Amer. Math. Soc.59.339 (1986), i–vi and 99–130

    1986

  20. [20]

    Three-Dimensional Manifolds, Kleinian Groups and Hyperbolic Geometry

    William P. Thurston. “Three-Dimensional Manifolds, Kleinian Groups and Hyperbolic Geometry”. In:Bull. Amer. Math. Soc. (N.S.)6.3 (1982), pp. 357–381. 56

    1982

  21. [21]

    Taut Normal Surfaces

    Jeffrey L. Tollefson and Ningyi Wang. “Taut Normal Surfaces”. In:Topology 35.1 (1996), pp. 55–75. 57

    1996