On linear sets of minimum size

From MaRDI portal
Publication:2222933

DOI10.1016/J.DISC.2020.112230zbMATH Open1456.51006arXiv2005.10931OpenAlexW3109266827MaRDI QIDQ2222933FDOQ2222933


Authors: Dibyayoti Dhananjay Jena, Geertrui Van de Voorde Edit this on Wikidata


Publication date: 27 January 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: An mathbbFq-linear set of rank k on a projective line mathrmPG(1,qh), containing at least one point of weight one, has size at least qk1+1 (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 k/2 and k1. Our construction extends the known examples of linear sets of size qk1+1 in mathrmPG(1,qh) constructed for k=h=4 [G. Bonoli and O. Polverino, mathbbFq-Linear blocking sets in mathrmPG(2,q4), Innov. Incidence Geom. 2 (2005), 35--56.] and k=h in [G. Lunardon and O. Polverino. Blocking sets of size qt+qt1+1. J. Comb. Theory, Ser: A 90 (2000), 148-158.]. We determine the weight distribution of the constructed linear sets and describe them as the projection of a subgeometry. For small k, we investigate whether all linear sets of size qk1+1 arise from our construction. Finally, we modify our construction to define linear sets of size qk1+qk2+ldots+qkl+1 in mathrmPG(l,q). This leads to new infinite families of small minimal blocking sets which are not of R'edei type.


Full work available at URL: https://arxiv.org/abs/2005.10931




Recommendations




Cites Work


Cited In (14)





This page was built for publication: On linear sets of minimum size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222933)