Szőnyi's minimum-size conjecture for non-trivial blocking sets
Let be a prime. Suppose that is the maximum field of linearity of a non-trivial blocking set in , where . A blocking set is a set of points meeting every line, and it is non-trivial if it contains no line.
Szőnyi's conjecture. The blocking set has at least
points.
This conjecture concerns the minimum size of non-trivial blocking sets and the role of their largest field of linearity. The supplied text gives no resolution status, so the conjecture is recorded as open.
References
- Jan De Beule and Geertrui Van de Voorde, “The minimum size of a linear set”, arXiv:1804.07388 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.