pith. sign in

arxiv: 2604.09221 · v1 · submitted 2026-04-10 · 🧮 math.AG · cs.CG· math.CO

Fast Isotopy Computation for T-Curves

Zoe Geiselmann , Michael Joswig , Lars Kastner , Konrad Mundinger , Sebastian Pokutta , Christoph Spiegel , Marcel Wack , Max Zimmer This is my paper

Pith reviewed 2026-05-10 16:56 UTC · model grok-4.3

classification 🧮 math.AG cs.CGmath.CO
keywords T-curvesViro patchworkingreal schemesisotopy typestriangulationsreal algebraic curvescomputational enumerationGPU algorithms
0
0 comments X

The pith

A near-quadratic algorithm extracts the isotopy type of a T-curve from its triangulation and sign distribution.

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

The paper presents an algorithm that computes the ambient isotopy type of a smooth real plane projective algebraic curve of degree d from a regular unimodular triangulation of d times the 2-simplex and a sign distribution on its lattice points. By Viro's Patchworking Theorem, this combinatorial data determines the real scheme, and the new method achieves this extraction in near-quadratic time. A GPU-accelerated version computes billions of such schemes per second, which enabled the complete enumeration of all 121 real schemes for degree seven. This turns theoretical patchworking constructions into a scalable computational tool for studying real algebraic curves.

Core claim

The central claim is a near-quadratic time algorithm for determining the isotopy type directly from the triangulation and the signs, which correctly implements the correspondence from Viro's Patchworking Theorem and supports exhaustive enumeration at scale through GPU acceleration.

What carries the argument

The isotopy extraction procedure that processes the simplices of the triangulation in accordance with the sign pattern to assemble the real scheme.

If this is right

  • The isotopy type of any T-curve can be found without constructing or solving the underlying polynomial equation.
  • Enumerating all possible sign distributions and triangulations becomes practical for degrees up to at least seven.
  • The method reproduces the complete list of 121 real schemes for degree-seven curves.
  • Billions of real schemes can be generated and classified per second on suitable hardware.

Where Pith is reading between the lines

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

  • This approach could extend to computing additional invariants such as the number of ovals or the nesting structure in more detail.
  • Similar techniques might apply to patchworking in higher-dimensional real algebraic varieties.
  • Large datasets of real schemes generated this way could reveal statistical patterns or support conjectures on the maximal number of components.

Load-bearing premise

The algorithm faithfully computes the isotopy type guaranteed by Viro's Patchworking Theorem for every regular unimodular triangulation and sign distribution.

What would settle it

A triangulation and sign distribution for which the algorithm produces an isotopy type that disagrees with the known classification or with the topology of a directly constructed curve of the same degree.

Figures

Figures reproduced from arXiv: 2604.09221 by Christoph Spiegel, Konrad Mundinger, Lars Kastner, Marcel Wack, Max Zimmer, Michael Joswig, Sebastian Pokutta, Zoe Geiselmann.

Figure 1
Figure 1. Figure 1: Algorithm A applied to a degree 5 (top) and degree 6 (bottom) example. (a) Connected components of same-sign vertices in T ⋄ , with antipodal boundary pairs labeled. (b) Regions after boundary identification; patchworked curve C(T , σ) drawn solid. The non-orientable root region is indicated by a semi-transparent band: for odd d it follows the pseudo-line; for even d (d = 6) it traces a Möbius strip throug… view at source ↗
Figure 2
Figure 2. Figure 2: Three degree-eight triangulations of A = 8·∆2 ∩Z 2 (top, first quadrant shown) and the distribution of the number of ovals over all 2 42 sign distributions (bottom). The first is the bow tie triangulation [5, Section 4.3], which realizes only even oval counts. The three triangulations realize 123, 359, and 353 real schemes, respectively. For d ≤ 5, exhaustively checking all triangulation orbits against all… view at source ↗
read the original abstract

A T-curve of degree $d$ is given by a regular unimodular triangulation of $d \cdot \Delta_2$ together with a sign distribution on its lattice points. By Viro's Patchworking Theorem, this determines the ambient isotopy type (a.k.a. real scheme) of a smooth real plane projective algebraic curve of the same degree. We present a near-quadratic time algorithm for extracting that isotopy type from the triangulation and the signs. Through a GPU-accelerated implementation, this allows one to compute billions of real schemes per second, enabling exhaustive enumeration at scale. This algorithm was essential for our recent construction of all 121 real schemes of degree seven by T-curves.

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

3 major / 2 minor

Summary. The paper presents a near-quadratic time algorithm that, given any regular unimodular triangulation of d·Δ₂ together with a sign distribution on its lattice points, computes the ambient isotopy type of the corresponding T-curve of degree d, as guaranteed by Viro's Patchworking Theorem. A GPU-accelerated implementation is described that achieves billions of real schemes per second and was used to complete the exhaustive enumeration of all 121 real schemes for degree seven.

Significance. If the algorithm is shown to be correct and complete, the work supplies an efficient, scalable computational primitive for enumerating real algebraic curves via T-curves. The reported GPU throughput and the resulting degree-seven classification constitute a concrete advance that makes previously intractable enumerations feasible.

major comments (3)
  1. [Algorithm section (near the description of isotopy extraction)] The manuscript provides no pseudocode, formal complexity analysis, or explicit handling of sign configurations on interior edges and vertices. Without these details it is impossible to confirm that every combinatorial case required by Viro's Patchworking Theorem is covered, which directly affects the reliability of the reported degree-seven count of 121 schemes.
  2. [Implementation and results section] No verification against the complete lists of real schemes for degrees 1–5 (or even selected known cases for degree 6) is reported. Such a check is load-bearing for the central claim that the procedure outputs the exact isotopy type for every regular unimodular triangulation and sign assignment.
  3. [Abstract and complexity discussion] The claim that the procedure runs in 'near-quadratic time' is stated in the abstract and used to justify the enumeration scale, yet no asymptotic analysis, input-size measure, or timing table is supplied to support it.
minor comments (2)
  1. [Abstract] The abstract introduces the term 'near-quadratic' without defining the precise big-O bound or the size parameter (number of triangles, vertices, or edges).
  2. [Introduction or Algorithm section] A small worked example showing the triangulation, sign assignment, and resulting isotopy type would greatly improve readability of the algorithmic description.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address each major point below, indicating where revisions will be made to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Algorithm section (near the description of isotopy extraction)] The manuscript provides no pseudocode, formal complexity analysis, or explicit handling of sign configurations on interior edges and vertices. Without these details it is impossible to confirm that every combinatorial case required by Viro's Patchworking Theorem is covered, which directly affects the reliability of the reported degree-seven count of 121 schemes.

    Authors: We agree that the manuscript would benefit from explicit pseudocode and a more detailed treatment of all sign configurations, including those on interior edges and vertices. The current prose description in Section 3 outlines the steps for extracting the isotopy type via Viro's theorem, but we will add pseudocode and a dedicated paragraph enumerating the combinatorial cases for interior elements in the revised version. A formal complexity analysis will also be supplied, defining the input size as the number of triangles (O(d²)) and showing the overall running time is O(n log n) for n triangles. revision: yes

  2. Referee: [Implementation and results section] No verification against the complete lists of real schemes for degrees 1–5 (or even selected known cases for degree 6) is reported. Such a check is load-bearing for the central claim that the procedure outputs the exact isotopy type for every regular unimodular triangulation and sign assignment.

    Authors: We performed internal verification of the algorithm against the known complete enumerations for degrees 1–5 and selected cases for degree 6, confirming exact matches with the literature. These checks were not reported in the manuscript. We will add a new subsection under Implementation and Results that tabulates these comparisons, thereby providing the requested load-bearing evidence for correctness on small degrees. revision: yes

  3. Referee: [Abstract and complexity discussion] The claim that the procedure runs in 'near-quadratic time' is stated in the abstract and used to justify the enumeration scale, yet no asymptotic analysis, input-size measure, or timing table is supplied to support it.

    Authors: The near-quadratic claim is based on the triangulation having Θ(d²) triangles and the algorithm performing a constant number of operations per triangle plus logarithmic factors for data structures. While a brief justification appears in the text, we acknowledge that a self-contained asymptotic analysis, explicit input-size definition, and empirical timing table are missing. These will be added to the complexity discussion and results section in the revision. revision: yes

Circularity Check

0 steps flagged

No circularity: algorithm is a direct implementation of external Viro theorem

full rationale

The paper's derivation consists of describing a near-quadratic algorithm that extracts isotopy types from a given regular unimodular triangulation and sign distribution, explicitly invoking Viro's Patchworking Theorem as the mathematical guarantee that this extraction yields the correct real scheme. No step re-derives the theorem, fits parameters to its own outputs, or relies on self-citations for the core correctness claim; the theorem is treated as an established external result from prior literature. The GPU implementation and degree-7 enumeration are applications of this procedure rather than inputs to it. The chain is self-contained against the cited theorem without reduction to its own fitted values or definitions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on Viro's Patchworking Theorem (treated as given) and standard facts about regular unimodular triangulations of dilated triangles; no new free parameters, ad-hoc axioms, or invented entities are introduced.

axioms (1)
  • domain assumption Viro's Patchworking Theorem correctly associates every regular unimodular triangulation of d·Δ₂ plus sign distribution with the ambient isotopy type of a smooth real plane curve of degree d.
    Invoked in the first sentence of the abstract as the justification for the input-output relation the algorithm must compute.

pith-pipeline@v0.9.0 · 5434 in / 1346 out tokens · 67280 ms · 2026-05-10T16:56:06.273712+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 · 19 canonical work pages

  1. [1]

    A. V. Aho, J. E. Hopcroft, and J. D. Ullman.The Design and Analysis of Com- puter Algorithms. Addison-Wesley, 1974

    work page 1974

  2. [2]

    Quantifier elimination for real closed fields by cylindrical alge- braic decomposition

    G. E. Collins. “Quantifier elimination for real closed fields by cylindrical alge- braic decomposition”. In:Automata theory and formal languages (Kaiserslautern, 1975). Vol. 33. Lecture Notes in Comput. Sci. Springer, Berlin-New York, 1975, pp. 134–183

    work page 1975

  3. [3]

    On the need of convexity in patchworking

    J. A. De Loera and F. J. Wicklin. “On the need of convexity in patchworking”. In:Adv. in Appl. Math.20.2 (1998), pp. 188–219

    work page 1998

  4. [4]

    Frühbis-Krüger, M

    A. Frühbis-Krüger, M. Joswig, and L. Kastner.Drawing real plane algebraic curves in OSCAR. 2026. arXiv:2603.12985

    work page arXiv 2026

  5. [5]

    121 Patchworked Curves of Degree Seven

    Z. Geiselmann, M. Joswig, L. Kastner, K. Mundinger, S. Pokutta, C. Spiegel, M. Wack, and M. Zimmer. “121 Patchworked Curves of Degree Seven”. In:preprint (2026). arXiv:2602.06888

    work page arXiv 2026

  6. [6]

    The topology of real projective algebraic varieties

    D. A. Gudkov. “The topology of real projective algebraic varieties”. English. In: Russ. Math. Surv.29.4 (1974), pp. 1–79

    work page 1974

  7. [7]

    Ueber die Vieltheiligkeit der ebenen algebraischen Curven

    A. Harnack. “Ueber die Vieltheiligkeit der ebenen algebraischen Curven”. In: Math. Ann.10 (1876), pp. 189–199

    work page

  8. [8]

    El-Hilany, J

    B. El-Hilany, J. Rau, and A. Renaudineau.Combinatorial Patchworking Tool. https://math.uniandes.edu.co/~j.rau/patchworking_english/patchworking. html. 2017

    work page 2017

  9. [9]

    Mathematische Probleme

    D. Hilbert. “Mathematische Probleme”. In:Nachr. Ges. Wiss. Göttingen Math.- Phys. Kl.1900 (1900). English translation (M. F. Winston Newson): Bull. Amer. Math. Soc. 8 (1902), 437–479, pp. 253–297

    work page 1900

  10. [10]

    Counter-examples to Ragsdale conjecture andT-curves

    I. Itenberg. “Counter-examples to Ragsdale conjecture andT-curves”. In:Real algebraic geometry and topology (East Lansing, MI, 1993). Amer. Math. Soc., Providence, RI, 1995, pp. 55–72

    work page 1993

  11. [11]

    Real tropical hyperfaces by patchworking inpolymake

    M. Joswig and P. Vater. “Real tropical hyperfaces by patchworking inpolymake”. In:Mathematical software – ICMS 2020. Ed. by A. M. Bigatti, J. Carette, J. H. Davenport, M. Joswig, and T. de Wolff. Vol. 12097. Lecture Notes in Computer Science. Springer, 2020

    work page 2020

  12. [12]

    Sixty-four curves of degree six

    N. Kaihnsa, M. Kummer, D. Plaumann, M. Sayyary Namin, and B. Sturmfels. “Sixty-four curves of degree six”. In:Exp. Math.28.2 (2019), pp. 132–150

    work page 2019

  13. [13]

    A worst-case bound for topology computation of algebraic curves

    M. Kerber and M. Sagraloff. “A worst-case bound for topology computation of algebraic curves”. In:J. Symbolic Comput.47.3 (2012), pp. 239–258

    work page 2012

  14. [14]

    Classification of flexibleM-curves of degree 8 up to isotopy

    S. Y. Orevkov. “Classification of flexibleM-curves of degree 8 up to isotopy”. In: Geom. Funct. Anal.12.4 (2002), pp. 723–755

    work page 2002

  15. [15]

    On the exact computation of the topology of real algebraic curves

    R. Seidel and N. Wolpert. “On the exact computation of the topology of real algebraic curves”. In:Computational geometry (SCG’05). ACM, New York, 2005, pp. 107–115

    work page 2005

  16. [16]

    Efficiency of a Good But Not Linear Set Union Algorithm

    R. E. Tarjan. “Efficiency of a Good But Not Linear Set Union Algorithm”. In: Journal of the ACM22.2 (1975), pp. 215–225

    work page 1975

  17. [17]

    Gluing of plane real algebraic curves and constructions of curves of degrees6and7

    O. Y. Viro. “Gluing of plane real algebraic curves and constructions of curves of degrees6and7”. In:Topology (Leningrad, 1982). Vol. 1060. Lecture Notes in Math. Springer, Berlin, 1984, pp. 187–200

    work page 1982

  18. [18]

    Patchworking real algebraic varieties

    O. Viro. “Patchworking real algebraic varieties”. In:preprint(2006). arXiv:math/ 0611382

    work page 2006

  19. [19]

    de Wolff, E

    T. de Wolff, E. O. Kwaakwah, and C. O’Neill.Viro.sage.https://cdoneill. sdsu.edu/viro/. v0.5b, posted Sep 7, 2021. 2021

    work page 2021