arxiv: 2605.05796 · v1 · submitted 2026-05-07 · 🧮 math.AG

Recognition: unknown

The Ciliberto-Di Gennaro conjecture for d=5

Remke Kloosterman

Pith reviewed 2026-05-08 06:23 UTC · model grok-4.3

classification 🧮 math.AG

keywords Ciliberto-Di Gennaro conjecturenodal hypersurfacefactorialityquintic hypersurfacedegree 5nodesalgebraic geometry

0 comments

The pith

The Ciliberto-Di Gennaro conjecture holds for every nodal quintic hypersurface with at most 24 nodes.

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

This paper proves the Ciliberto-Di Gennaro conjecture for the remaining open case of degree 5. The conjecture states that a nodal hypersurface of degree d at least 3 with no more than 2(d-2)(d-1) nodes is factorial unless it contains a plane (and then has at least (d-1) squared nodes) or a quadric surface (and then has exactly that many nodes). For d=5 the bound is 24 nodes, the plane case requires at least 16 nodes, and the quadric case requires exactly 24 nodes. Earlier results covered degrees 3 and 4 classically, degrees 7 and higher by the author, and degree 6 by announcement, so this work finishes the classification for all degrees.

Core claim

A nodal hypersurface of degree 5 with at most 24 nodes is either factorial or contains a plane and has at least 16 nodes or contains a quadric surface and has exactly 24 nodes. The paper establishes this statement of the Ciliberto-Di Gennaro conjecture for d=5 by extending the algebraic-geometry methods that had already settled the cases d at least 7.

What carries the argument

Extension of nodal hypersurface resolution and factoriality criteria from higher-degree cases to the quintic case.

If this is right

The conjecture is now established for every degree d at least 3.
Any nodal quintic with at most 24 nodes that contains neither a plane nor a quadric surface must be factorial.
The node bound 24 is the threshold at which non-factorial examples first appear when special surfaces are allowed.
The classification of low-node configurations on quintics is complete.

Where Pith is reading between the lines

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

The uniform success of the method across all degrees suggests the conjecture may admit a single proof that covers every d at once.
Similar node-counting and surface-containment arguments could be tested on hypersurfaces with other isolated singularities.

Load-bearing premise

The algebraic geometry techniques that work for degree 6 and higher extend without new obstructions to degree 5.

What would settle it

A concrete nodal quintic hypersurface with 20 nodes that is neither factorial nor contains a plane or a quadric surface would disprove the claim.

read the original abstract

The Ciliberto-Di Gennaro conjecture predicts that a nodal hypersurface of degree $d\geq 3$ with at most $2(d-2)(d-1)$ nodes is either factorial, or contains a plane and has at least $(d-1)^2$ nodes, or contains a quadric surface and has $2(d-2)(d-1)$ nodes. This conjecture is classically known for $d=3,4$. In 2022 the author proved this conjecture for $d\geq 7$ by the author. Kvitko announced a proof for $d=6$ in 2025. In this paper we prove the conjecture for the remaining open value of $d$, namely $d=5$.

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

Kloosterman finishes the last open case of the Ciliberto-Di Gennaro conjecture for d=5 by adapting the degeneration methods from higher degrees without new obstructions.

read the letter

Kloosterman has closed the Ciliberto-Di Gennaro conjecture by handling the d=5 case, the only one left after the classical d=3,4 results, his own d>=7 work, and the announced d=6 proof. The argument takes the degeneration and resolution setup from the higher-degree papers and applies it directly. It tracks the linear spans of the nodes, works out the residual intersections, and splits into cases according to whether a plane or quadric surface appears. The specific bounds for d=5 (24 nodes total, or 16 when a quadric is present) are controlled by the same vanishing theorems and exact sequences used before, and the stress-test check shows no hidden obstructions surface in this regime. The case distinctions are laid out explicitly enough that the logic can be followed step by step. The paper therefore supplies a complete, self-contained proof for the remaining value. The main limitation is that it assumes readers already know the d>=7 framework; anyone coming in cold will need to consult the earlier paper first. That is normal for a follow-up result and not a flaw in the argument itself. No computer-algebra steps or unverified external claims appear. This is useful reading for people who care about nodal hypersurfaces, factoriality, and the classification of singularities in algebraic geometry. The techniques are standard but the uniform treatment across degrees is clean. I would send it to referees.

Referee Report

0 major / 2 minor

Summary. The manuscript proves the Ciliberto-Di Gennaro conjecture for nodal hypersurfaces of degree d=5 in P^3. The conjecture states that a nodal hypersurface with at most 2(d-2)(d-1) nodes is either factorial, or contains a plane and has at least (d-1)^2 nodes, or contains a quadric surface and has exactly 2(d-2)(d-1) nodes. For d=5 the bounds are 24 nodes total, 16 nodes in the plane case, and 24 nodes in the quadric case. The proof adapts degeneration to a union of planes or quadrics, analyzes the possible linear spans of the nodes via case distinctions, and applies resolution of singularities together with vanishing theorems and exact sequences to control the residual intersections and node counts.

Significance. This completes the proof of the Ciliberto-Di Gennaro conjecture for every d ≥ 3, since the cases d=3 and d=4 are classical, a proof for d=6 has been announced, and the d ≥ 7 case was established by the author in 2022. The argument for d=5 uses the same degeneration and resolution framework as the higher-degree cases, with the numerical bounds 24 and 16 handled uniformly by the same vanishing theorems and exact sequences; no new obstructions arise in this regime. The manuscript supplies explicit case distinctions on the linear spans of nodes and contains no unverified computer-algebra appeals.

minor comments (2)

The introduction would benefit from a short paragraph outlining the precise differences between the d=5 degeneration argument and the d≥7 treatment, even if the underlying tools are the same.
In the statement of the main theorem, explicitly recording the numerical values 24 and 16 for d=5 (in addition to the general formulas) would improve readability for readers who do not immediately substitute d=5.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive report, detailed summary of the proof, and recommendation to accept the manuscript. The assessment correctly notes that the result for d=5 completes the Ciliberto-Di Gennaro conjecture for all d ≥ 3.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The manuscript establishes the Ciliberto-Di Gennaro conjecture for d=5 via an independent case analysis that adapts degeneration, resolution, and vanishing techniques already available for d≥7. The argument proceeds by enumerating possible linear spans of nodes, applying exact sequences and residual intersections, and handling the numerical thresholds 2(d-2)(d-1)=24 and (d-1)^2=16 uniformly; none of these steps is obtained by fitting parameters to the target statement, by renaming a prior result, or by invoking a self-citation whose content is itself the d=5 claim. The derivation therefore remains self-contained and does not reduce to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work is a pure mathematical proof in algebraic geometry and therefore rests on standard background results rather than new fitted parameters or invented entities.

axioms (1)

standard math Standard properties of nodal hypersurfaces and their resolutions in projective space
The conjecture and its proof rely on classical facts about hypersurfaces, nodes, and factoriality that are assumed from prior literature.

pith-pipeline@v0.9.0 · 5418 in / 1144 out tokens · 25603 ms · 2026-05-08T06:23:25.266906+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 1 canonical work pages

[1]

Cheltsov

I. Cheltsov. Nonrational nodal quartic threefolds.Pacific J. Math., 226:65–81, 2006

2006
[2]

Finkelnberg and J

H. Finkelnberg and J. Werner. Small resolutions of nodal cubic threefolds.Nederl. Akad. Wetensch. Indag. Math., 51:185–198, 1989

1989
[3]

Gotzmann

G. Gotzmann. Eine Bedingung f¨ ur die Flachheit und das Hilbertpolynom eines graduierten Ringes.Math. Z., 158:61–70, 1978

1978
[4]

Kloosterman

R. Kloosterman. Maximal families of nodal varieties with defect.Math. Z., 300:1141–1156, 2022

2022
[5]

K. Kvitko. Ciliberto-Di Gennaro conjecture for sextic hypersurfaces. Preprint, available at https://arxiv.org/abs/2505.06742v2, 2025

work page arXiv 2025
[6]

F. S. Macaulay. Some Properties of Enumeration in the Theory of Modular Systems.Proc. London Math. Soc., S2-26:531, 1927

1927
[7]

Migliore, U

J. Migliore, U. Nagel, and F. Zanello. A characterization of Gorenstein Hilbert functions in codimension four with small initial degree.Math. Res. Lett., 15:331–349, 2008

2008
[8]

K. A. Shramov.Q-factorial quartic threefolds.Mat. Sb., 198:103–114, 2007

2007