A proof of the linearity conjecture for k-blocking sets in PG(n,p^3), \, p prime

From MaRDI portal
Publication:2431246

DOI10.1016/J.JCTA.2010.11.013zbMATH Open1235.51015arXiv1201.3296OpenAlexW2090714405WikidataQ122884077 ScholiaQ122884077MaRDI QIDQ2431246FDOQ2431246


Authors: Michel Lavrauw, Geertrui Van de Voorde, Leo Storme Edit this on Wikidata


Publication date: 11 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: A proof of the linearity conjecture for \(k\)-blocking sets in PG\((n,p^{3}), \, p\) prime

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