A proof of the linearity conjecture for k-blocking sets in PG(n, p3), p prime
classification
🧮 math.CO
keywords
primek-blockingconjecturelinearityminimalsetssmallcase
read the original abstract
In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking sets in PG(n, p^3), p prime, p >=7, are Fp-linear, proving the linearity conjecture (see [7]) in the case PG(n, p3), p prime, p >= 7.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.