The minimum size of a linear set (2019)
AuthorsDe Beule J, Van de Voorde Gshow all
In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1,qn). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a subspace. We then use this result to find a lower bound on the number of points in an Fq-linear set of rank k in PG(2,qn). In the case k=n, this confirms a conjecture by Sziklai in .
CitationDe Beule J, Van de Voorde G (2019). The minimum size of a linear set. Journal of Combinatorial Theory. Series A. 164. 109-124.
This citation is automatically generated and may be unreliable. Use as a guide only.