A bound for the number of lines lying on a nonsingular surface in $3$-space over a finite field
Masaaki Homma, Seon Jeong Kim

TL;DR
This paper establishes an upper bound on the number of lines lying on a nonsingular surface of degree d in three-dimensional projective space over a finite field, with the bound being optimal for specific degrees.
Contribution
It provides a new bound on the maximum number of lines on nonsingular surfaces in finite fields, extending understanding of geometric configurations in algebraic geometry.
Findings
Bound of ((d-1)q+1)d lines for nonsingular degree d surfaces
Bound is optimal for d=2, d=√q+1, d=q+1
Advances knowledge of line configurations on algebraic surfaces
Abstract
A nonsingular surface of degree in over has at most -lines, and this bound is optimal for .
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
TopicsCoding theory and cryptography · Finite Group Theory Research · Limits and Structures in Graph Theory
