(r,s)-sets from Desarguesian ovoids
Abstract
An (r, s)- set in PG(n, q) is a set of points, say X, such that each s-dimensional projective subspace contains at most r points of X. We investigate (n, n-2)-sets and (n-2, n-3)-sets in PG(n, q), n 6. We show that the trivial upper bounds on (n, n-2)-sets in PG(n, q), 4 n 6, (4, 3)-sets in PG(6, q) and (3, 2)-sets in PG(5, q) are essentially sharp. A (3, 2)-set in PG(13, q) of size q6-1q-1 is also constructed.
0
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.