2000 character limit reached
A small minimal blocking set in PG(n,p^t), spanning a (t-1)-space, is linear
Published 3 Oct 2012 in math.CO | (1210.1003v1)
Abstract: In this paper, we show that a small minimal blocking set with exponent e in PG(n,pt), p prime, spanning a (t/e-1)-dimensional space, is an F_pe-linear set, provided that p>5(t/e)-11. As a corollary, we get that all small minimal blocking sets in PG(n,pt), p prime, p>5t-11, spanning a (t-1)-dimensional space, are F_p-linear, hence confirming the linearity conjecture for blocking sets in this particular case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.