2000 character limit reached
The Maschke octic contains 96 pairwise disjoint lines (2601.00033v1)
Published 30 Dec 2025 in math.AG and math.RT
Abstract: Miyaoka proved that a smooth surface of degree $d$ in ${\mathbf{P}}3({\mathbb{C}})$ contains at most $2d(d-2)$ pairwise disjoint lines. In this note, we verify that the Maschke octic contains $96$ pairwise disjoint lines, thereby proving that Miyaoka's bound is optimal for $d=8$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
