Constructing minimal blocking sets using field reduction

DOI10.1002/JCD.21432MaRDI QIDQ2808797zbMATHOpenAlexFDO

Authors Geertrui Van de Voorde

Publication date 24 May 2016

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

linear setblocking setDesarguesian spreadfield reductionlinearity conjecture

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21)

Abstract: We present a construction for minimal blocking sets with respect to $(k-1)$-spaces in $mathrmPG(n-1,q^t)$, the $(n-1)$-dimensional projective space over the finite field $mathbb{F}_{q^t}$ of order $q^t$. The construction relies on the use of blocking cones in the {em field reduced} representation of $mathrmPG(n-1,q^t)$, extending the well-known construction of linear blocking sets. This construction is inspired by the construction for minimal blocking sets with respect to the hyperplanes by Mazzocca, Polverino and Storme ({em the MPS-construction}); we show that for a suitable choice of the blocking cone over a planar blocking set, we obtain larger blocking sets than the ones obtained from planar blocking sets in cite{pol}. Furthermore we show that every minimal blocking set with respect to the hyperplanes in $mathrmPGPG(n-1,q^t)$ can be obtained by applying field reduction to a minimal blocking set with respect to $(nt-t-1)$-spaces in $mathrmPG(nt-1,q)$. We end by relating these constructions to the linearity conjecture for small minimal blocking sets. We show that if a small minimal blocking set is constructed from the MPS-construction, it is of R'edei-type whereas a small minimal blocking set arises from our cone construction if and only if it is linear.

Recommendations

• Blocking sets in \(\mathrm{PG}(r,q^n)\)
• On MPS construction of blocking sets in projective spaces: a generalization
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• scientific article; zbMATH DE number 7666857
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• Small point sets of PG\((2, q)\) intersecting each \(k\)-space in 1 modulo \(\sqrt q\) points
• Minimal blocking sets in projective spaces of square order
• Proper blocking sets in projective spaces
• Small blocking sets in higher dimensions
• 2-blocking sets in PG(4, \(q\)), \(q\) square

Cites work

• Blocking sets and partial spreads in finite projective spaces
• Blocking sets in \(\mathrm{PG}(r,q^n)\)
• Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
• Covering finite fields with cosets of subspaces
• Finite Sperner spaces constructed from projective and affine spaces
• Linear \(k\)-blocking sets
• Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
• Lower bounds for the cardinality of minimal blocking sets in projective spaces
• Normal spreads
• On large minimal blocking sets in PG(2,q)
• On linear sets on a projective line
• On small blocking sets
• On small blocking sets and their linearity
• On the linearity of higher-dimensional blocking sets
• Proper blocking sets in projective spaces
• Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
• Small blocking sets in higher dimensions
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
• The blocking number of an affine space

Cited in

(5)

• Blocker size via matching minors
• Codes from the incidence matrices of graphs on 3-sets
• Minimum blocking configurations
• Field reduction and linear sets in finite geometry
• On the construction and enumeration of minimal blocks

Describes a project that uses

Uses Software

• FinInG

This page was built for publication: Constructing minimal blocking sets using field reduction

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