Complete enumeration of maximal T-curves in degrees eight and nine

We use a highly parallelized backtracking algorithm implemented in CUDA to enumerate every compatible collection of Harnack splits in degrees eight and nine. By a theorem of Haas (1997) this yields every maximal T-curve. In this way, we find that exactly 38 real schemes of real plane algebraic curves of degree eight with 22 real components and 225 of degree nine with 29 real components are realized by combinatorial patchworking.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16659
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Complete enumeration of maximal T-curves in degrees eight and nine

Lars Kastner, Michael Joswig, Marcel Wack, Zoe Geiselmann
arXiv (Cornell University)
Algebraic Geometry and Number Theory
preprint

Complete enumeration of maximal T-curves in degrees eight and nine

Lars Kastner, Michael Joswig, Marcel Wack, Zoe Geiselmann
preprint en

Abstract

We use a highly parallelized backtracking algorithm implemented in CUDA to enumerate every compatible collection of Harnack splits in degrees eight and nine. By a theorem of Haas (1997) this yields every maximal T-curve. In this way, we find that exactly 38 real schemes of real plane algebraic curves of degree eight with 22 real components and 225 of degree nine with 29 real components are realized by combinatorial patchworking.

arXiv (Cornell University)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon