On linear sets of minimum size
Dibyayoti Jena, Geertrui Van de Voorde

TL;DR
This paper constructs a broad family of linear sets in projective lines that meet the minimal size bound, allowing prescribed maximum point weights, and explores their properties and extensions.
Contribution
It introduces a new construction of linear sets meeting the minimal size bound with prescribed weights, extending previous examples and analyzing their structure and distribution.
Findings
Constructed linear sets of size q^{k-1}+1 with prescribed maximum weights.
Determined the weight distribution of the constructed linear sets.
Extended the construction to higher dimensions, creating new families of small minimal blocking sets.
Abstract
An -linear set of rank on a projective line , containing at least one point of weight one, has size at least (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J. Comb. Theory, Ser: A 164 (2019), 109-124.]). The classical example of such a set is given by a club. In this paper, we construct a broad family of linear sets meeting this lower bound, where we are able to prescribe the weight of the heaviest point to any value between and . Our construction extends the known examples of linear sets of size in constructed for [G. Bonoli and O. Polverino, -Linear blocking sets in , Innov. Incidence Geom. 2 (2005), 35--56.] and in [G. Lunardon and O. Polverino. Blocking sets of size . J. Comb. Theory, Ser: A 90 (2000),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
