On the linearity of higher-dimensional blocking sets
From MaRDI portal
Publication:612966
zbMATH Open1205.51005arXiv1201.3300MaRDI QIDQ612966FDOQ612966
Authors: Geertrui Van de Voorde 
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n - k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies this property. The linearity conjecture states that all small minimal k-blocking sets in PG(n, q) are linear over a subfield Fpe of Fq. Apart from a few cases, this conjecture is still open. In this paper, we show that to prove the linearity conjecture for k- blocking sets in PG(n, pt), with exponent e and pe geq 7, it is sufficient to prove it for one value of n that is at least 2k. Furthermore, we show that the linearity of small minimal blocking sets in PG(2, q) implies the linearity of small minimal k-blocking sets in PG(n, pt), with exponent e, with pe geq t/e + 11.
Full work available at URL: https://arxiv.org/abs/1201.3300
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A proof of the linearity conjecture for \(k\)-blocking sets in PG\((n,p^{3}), \, p\) prime
- A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear
- Small blocking sets in higher dimensions
- Small point sets of \(\text{PG}(n, q ^{3})\) intersecting each \(k\)-subspace in 1 mod \(q\) points
- Blocking sets in projective spaces
Cited In (15)
- The minimum size of a linear set
- On small blocking sets and their linearity
- A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear
- A geometric characterisation of linear \(k\)-blocking sets
- Small blocking sets in higher dimensions
- Computing Blocker Sets for the Regular Post Embedding Problem
- A higgledy-piggledy set of planes based on the ABB-representation of linear sets
- Blocking sets in line Grassmannians
- Constructing minimal blocking sets using field reduction
- Title not available (Why is that?)
- The use of blocking sets in Galois geometries and in related research areas
- Blocking sets in projective spaces
- On low weight codewords of generalized affine and projective Reed-Muller codes
- Obstructions for linear rank-width at most 1
- A proof of the linearity conjecture for \(k\)-blocking sets in PG\((n,p^{3}), \, p\) prime
This page was built for publication: On the linearity of higher-dimensional blocking sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612966)
