OpenFrontiers
← Back to the index

Asymptotic line-count constant for smooth surfaces of degree dd in P3\mathbb{P}^3 in characteristic 00 (C76C_{76})

Asymptotic line-count constant for smooth surfaces of degree dd in P3\mathbb{P}^3 in characteristic 00: determine C76C_{76} or improve its bounds; the repository records 3 (lower) and 11 (upper).

Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.

Licensed source statementAs of Repository table at commit 2c1968c (2026-09-26); open while the recorded lower and upper bounds differSource & evidence ↓

Problem statement

For each integer d≥3d \ge 3, let ℓ0(d)\ell_0(d) denote the maximal number of lines contained in a smooth surface of degree dd in PC3\mathbb P^3_{\mathbb C}.

We define

C76:=lim sup⁡d→∞ℓ0(d)d2.C_{76} := \limsup_{d\to\infty}\frac{\ell_0(d)}{d^2}.

The constant C76C_{76} measures the quadratic growth rate of the maximal line count on smooth complex degree-dd surfaces. The problem is open; the best established range is

3≤C76≤11.3 \le C_{76} \le 11.

[BS2007-lb-3d2] [BR2023-ub-11d2]

The current best general upper bound is due to Bauer and Rams,

ℓ0(d)≤11d2−30d+18,\ell_0(d) \le 11d^2 - 30d + 18,

while a standard infinite lower-bound family comes from surfaces of the form φ(x,y)−ψ(z,t)=0\varphi(x,y)-\psi(z,t)=0, which give at least 3d23d^2 lines for every dd. [BR2023-ub-11d2] [BS2007-lb-3d2]

Bauer and Rams also note that the exact fixed-degree maximum remains unknown for every d≥5d \ge 5. [BR2023-ub-11d2]

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  • Classical-family ceiling. Boissière and Sarti show that the two classical constructions they analyze—surfaces φ(x,y)−ψ(z,t)=0\varphi(x,y)-\psi(z,t)=0 and cyclic dd-covers of P2\mathbb P^2 branched over a smooth plane curve—do not exceed the 3d23d^2 threshold. [BS2007-classical-cap]

  • Sporadic fixed-degree improvements. They also construct a symmetric octic with 352352 lines. Thus specific degrees can substantially outperform the baseline value 3d23d^2 coming from the standard infinite family. [BS2007-octic-352] [BS2007-lb-3d2]

  • Fixed-degree open problems. Even in degree 55 one currently only has the bound ℓ0(5)≤127\ell_0(5)\le127, and Bauer–Rams emphasize that the exact fixed-degree maximum is still open for every d≥5d \ge 5. [BR2023-quintic-segre] [BR2023-ub-11d2]

  • Why characteristic 00 is built into the definition. Page, Ryan, and Smith prove that for smooth degree-dd surfaces with d>3d>3 over algebraically closed fields, one has ℓ(S)≤d2(d2−3d+3)\ell(S)\le d^2(d^2-3d+3), with equality attained precisely in positive characteristic for certain Fermat surfaces with d=pe+1d=p^e+1. Along this infinite family, ℓ(S)/d2=d2−3d+3→∞\ell(S)/d^2=d^2-3d+3\to\infty, so removing the characteristic-00 hypothesis would make the corresponding limsup infinite. [PRS2024-maximal-lines]

References (from the repository page)

  • [BR2023] Bauer, Thomas; Rams, Sławomir. Counting lines on projective surfaces. Annali Scuola Normale Superiore di Pisa - Classe di Scienze (5) 24 (2023), no. 3, 1285–1299. DOI: 10.2422/2036-2145.202111_010. arXiv PDF: 1902.05133v2. Google Scholar

  • [BR2023-quintic-segre] loc: arXiv v2 PDF p.1, §1 Introduction, file 1902.05133v2.pdf quote: “By contrast, the maximal number of lines on smooth hypersurfaces in P3(C)P^3(\mathbb C) of a fixed degree d≥5d \ge 5 remains unknown (see [18], [3], [12], [6]). In the case of smooth quintic surfaces the proof of the inequality ℓ(X5)≤127\ell(X_5) \le 127 can be found in the recent paper [16], whereas (until now) the best bound for smooth complex surfaces of degree d≥6d \ge 6 has been the inequality (1) ℓ(Xd)≤(d−2)(11d−6)(1)\ \ell(X_d) \le (d-2)(11d-6) that was stated by Segre in [18, § 4].”

  • [BR2023-ub-11d2] loc: arXiv v2 PDF p.2, §1 Introduction (Theorem 1.1), file 1902.05133v2.pdf quote: “Theorem 1.1. Let Xd⊂P3(K)X_d \subset P^3(K) be a smooth surface of degree d≥3d \ge 3 over a field of characteristic 00 or of characteristic p>dp > d. Let ℓ(Xd)\ell(X_d) be the number of lines that the surface XdX_d contains. Then the following inequality holds (2) ℓ(Xd)≤11d2−30d+18(2)\ \ell(X_d) \le 11d^2 - 30d + 18. This result provides the lowest known bound on the number of lines lying on a degree-dd surface for d≥6d \ge 6. Still, the question what is the maximal number of lines on smooth projective surfaces of a fixed degree d≥5d \ge 5 remains open.”

  • [BR2023-ub-clebsch] loc: arXiv v2 PDF p.2, §1 Introduction, file 1902.05133v2.pdf quote: “The first bound on the number of lines on a smooth degree-dd surface was stated by Clebsch: (3) ℓ(Xd)≤d(11d−24)(3)\ \ell(X_d) \le d(11d-24) ([4, p. 106]), who used ideas coming from Salmon ([4, p. 95], [17]).”

  • [BS2007] Boissière, Samuel; Sarti, Alessandra. Counting lines on surfaces. Annali Scuola Normale Superiore di Pisa - Classe di Scienze (5) 6 (2007), no. 1, 39–52. DOI: 10.2422/2036-2145.2007.1.03. arXiv PDF: math/0606100v1. Google Scholar

  • [BS2007-lb-3d2] loc: arXiv v1 PDF p.2, §1 Introduction (statement of Proposition 3.3), file math/0606100v1.pdf quote: “Proposition 3.3 The maximal numbers of lines on F=0F = 0 are: • Nd=3d2N_d = 3d^2 for d≥3d \ge 3, d≠4,6,8,12,20d \neq 4, 6, 8, 12, 20; • N4=64N_4 = 64, N6=180N_6 = 180, N8=256N_8 = 256, N12=864N_{12} = 864, N20=1600N_{20} = 1600.”

  • [BS2007-classical-cap] loc: arXiv v1 PDF p.11, §4 (Proposition 4.2), file math/0606100v1.pdf quote: “Then SS contains exactly β⋅d\beta \cdot d lines. In particular, it contains no more than 3d23d^2 lines.”

  • [BS2007-octic-352] loc: arXiv v1 PDF p.1, Abstract, file math/0606100v1.pdf quote: “We obtain in particular a symmetric octic with 352 lines.”

  • [PRS2024] Page, Janet; Ryan, Tim; Smith, Karen E. Smooth Surfaces with Maximal Lines. Preprint (2024). DOI: 10.48550/arXiv.2406.15868. arXiv PDF: 2406.15868v2. Google Scholar

  • [PRS2024-maximal-lines] loc: arXiv v2 PDF p.1, Abstract and Theorem 1.1, file 2406.15868v2.pdf quote: “Theorem 1.1. Let S⊆P3S \subseteq P^3 be a smooth algebraic surface of degree d>3d > 3 over an algebraically closed field kk. Then SS contains at most d2(d2−3d+3)d^2(d^2 - 3d + 3) lines. Furthermore, SS contains exactly d2(d2−3d+3)d^2(d^2 - 3d + 3) lines if and only if (i) kk has characteristic p>0p > 0; (ii) d=pe+1d = p^e + 1 for some e∈Ne \in \mathbb N; and (iii) SS is projectively equivalent to the Fermat surface defined by (1) xpe+1+ype+1+zpe+1+wpe+1=0(1)\ x^{p^e+1} + y^{p^e+1} + z^{p^e+1} + w^{p^e+1} = 0.”

Progress & source assessment

Repository table (commit 2c1968c, 26 September 2026): best known lower bound 3; best known upper bound 11. Values marked with an asterisk have minimal verification.

Known upper bounds

Bound Reference Comments
ℓ0(d)≤d(11d−24)\ell_0(d) \le d(11d-24) [BR2023] Historical Clebsch bound, recorded in Bauer–Rams; it already implies C76≤11C_{76} \le 11. [BR2023-ub-clebsch]
ℓ0(d)≤(d−2)(11d−6)\ell_0(d) \le (d-2)(11d-6) [BR2023] Segre’s classical improvement; as summarized by Bauer–Rams, this was the best general bound for smooth complex degree-dd surfaces with d≥6d \ge 6 until 2023. [BR2023-quintic-segre]
ℓ0(d)≤11d2−30d+18\ell_0(d) \le 11d^2 - 30d + 18 [BR2023] Current best general upper bound in characteristic 00, valid for d≥3d \ge 3. [BR2023-ub-11d2]

Known lower bounds

Bound Reference Comments
ℓ0(d)≥3d2\ell_0(d) \ge 3d^2 [BS2007] Achieved by the classical family φ(x,y)−ψ(z,t)=0\varphi(x,y)-\psi(z,t)=0; within that family the exact count is 3d23d^2 except for the finitely many exceptional degrees 4,6,8,12,204,6,8,12,20. Therefore C76≥3C_{76} \ge 3. [BS2007-lb-3d2]
References
  1. [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Asymptotic line-count constant for smooth surfaces of degree $d$ in $\mathbb{P}^3$ in characteristic $0$ ($C_{76}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.