arXiv:2301.13001 [math.CO]AbstractReferencesReviewsResources
On the minimum size of linear sets
Sam Adriaensen, Paolo Santonastaso
Published 2023-01-30Version 1
Recently, a lower bound was established on the size of linear sets in projective spaces, that intersect a hyperplane in a canonical subgeometry. There are several constructions showing that this bound is tight. In this paper, we generalize this bound to linear sets meeting some subspace $\pi$ in a canonical subgeometry. We also give constructions of linear sets attaining equality in this bound, both in the case that $\pi$ is a hyperplane, and in the case that $\pi$ is a lower dimensional subspace.
Comments: 24 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2005.10931 [math.CO] (Published 2020-05-21)
On linear sets of minimum size
arXiv:1905.04978 [math.CO] (Published 2019-05-13)
Small weight code words arising from the incidence of points and hyperplanes in PG($n,q$)
arXiv:2001.09123 [math.CO] (Published 2020-01-24)
What fraction of an $S_n$-orbit can lie on a hyperplane?