Trivial upper bounds on (n,n-2)-sets in PG(n,q) for n=4,5,6 and related cases are shown to be essentially sharp, with a (3,2)-set of size (q^6-1)/(q-1) constructed in PG(13,q) from Desarguesian ovoids.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
$(r,s)$-sets from Desarguesian ovoids
Trivial upper bounds on (n,n-2)-sets in PG(n,q) for n=4,5,6 and related cases are shown to be essentially sharp, with a (3,2)-set of size (q^6-1)/(q-1) constructed in PG(13,q) from Desarguesian ovoids.