Small maximal partial ovoids in generalized quadrangles
Jeroen Schillewaert, Jacques Verstraete

TL;DR
This paper presents a new construction of small maximal partial ovoids in generalized quadrangles, achieving sizes close to theoretical lower bounds and improving upon previous quadratic bounds in specific cases.
Contribution
It introduces a construction method for maximal partial ovoids of size near the lower bounds in a broad class of quadrangles, notably improving bounds in the case of elliptic quadrics.
Findings
Constructed maximal partial ovoids of size at most s·polylog(s)
Achieved bounds within a polylogarithmic factor of lower bounds
Improved quadratic upper bounds in elliptic quadrics Q^-(5,s)
Abstract
A {\em maximal partial ovoid} of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the literature. In general, theoretical lower bounds on the size of a maximal partial ovoid in a quadrangle of order are linear in . In this paper, in a wide class of quadrangles of order we give a construction of a maximal partial ovoid of size at most , which is within a polylogarithmic factor of theoretical lower bounds. The construction substantially improves previous quadratic upper bounds in quadrangles of order , in particular in the well-studied case of the elliptic quadrics .
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
TopicsFinite Group Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
