Lines on K3-quartics via triangular sets
Alex Degtyarev, S{\l}awomir Rams

TL;DR
This paper establishes the maximum number of lines on certain complex K3-surfaces and classifies configurations with many lines on smooth quartic surfaces, advancing understanding of algebraic geometry structures.
Contribution
It provides a sharp upper bound for lines on degree four K3-surfaces with singularities and classifies configurations exceeding 48 lines on smooth quartics.
Findings
Maximum of 52 lines on singular degree four K3-surfaces.
Classification of line configurations with over 48 lines on smooth quartics.
Abstract
We prove the sharp upper bound of at most lines on a complex K3-surface of degree four with a non-empty singular locus. We also classify the configurations of more than lines on smooth complex quartics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
