Large (k; r, s; n, q)-sets in Projective Spaces
Abstract
A (k; r, s; n, q)-set (short: (r,s)-set) of PG(n, q) is a set of points X with |X| = k such that no s-space contains more than r points of X. We investigate the asymptotic size of (r, s)-sets for n fixed and q → ∞. In particular, we show the existence of (3, 2)-sets of size (1+o(1)) q3/2 for n=6, (4, 2)-sets of size (1+o(1)) qn-12, and (9, 2)-sets of size (1+o(1)) q2 for n=4. We also generalize a bound by Rao from 1947 and show that an (r,s)-set has size at most O(qn-e+1e) if there exist integers d,e ≥ 2 such that s=d(e-1) and r=de-1.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.