On the minimum size of linear sets
From MaRDI portal
Publication:6424840
arXiv2301.13001MaRDI QIDQ6424840FDOQ6424840
Authors: Sam Adriaensen, Paolo Santonastaso
Publication date: 30 January 2023
Abstract: 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 in a canonical subgeometry. We also give constructions of linear sets attaining equality in this bound, both in the case that is a hyperplane, and in the case that is a lower dimensional subspace.
Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
This page was built for publication: On the minimum size of linear sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6424840)