Minimal multiple blocking sets

MaRDI QIDQ668041zbMATH OpenFDO

Authors Anurag Bishnoi, Sam Mattheus, Jeroen Schillewaert

Publication date 5 March 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.07843, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p66

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

blocking setfinite geometrysymmetric designexpander mixing lemma

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21)

Abstract: We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most [frac{1}{2} nsqrt{4tn - (3t + 1)(t - 1)} + frac{1}{2} (t - 1)n + t.] This is the first general upper bound on the size of minimal $t$-fold blocking sets in finite projective planes and it generalizes the classical result of Bruen and Thas on minimal blocking sets. From the proof it directly follows that if equality occurs in this bound then every line intersects the blocking set $S$ in either $t$ points or $frac12(sqrt4tn-(3t+1)(t-1)+t-1)+1$ points. We use this to show that for $n$ a prime power, equality can occur in our bound in exactly one of the following three cases: (a) $t=1$, $n$ is a square and $S$ is a unital; (b) $t=n-sqrtn$, $n$ is a square and $S$ is the complement of a Baer subplane; (c) $t=n$ and $S$ is equal to the set of all points except one. For a square prime power $q$ and $tleqsqrtq+1$, we give a construction of a minimal $t$-fold blocking set $S$ in $mathrmPG(2,q)$ with $|S|=qsqrtq+1+(t-1)(q-sqrtq+1)$. Furthermore, we obtain an upper bound on the size of minimal blocking sets in symmetric $2$-designs and use it to give new proofs of other known results regarding tangency sets in higher dimensional finite projective spaces. We also discuss further generalizations of our bound. In our proofs we use an incidence bound on combinatorial designs which follows from applying the expander mixing lemma to the incidence graph of these designs.

Recommendations

• On multiple blocking sets in Galois planes
• A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
• Multiple Blocking Sets and Arcs in Finite Planes
• Blocking sets in Desarguesian affine and projective planes
• On large minimal blocking sets in PG(2,q)

Cites work

• scientific article; zbMATH DE number 3964848 (Why is no real title available?)
• scientific article; zbMATH DE number 3719164 (Why is no real title available?)
• scientific article; zbMATH DE number 24836 (Why is no real title available?)
• scientific article; zbMATH DE number 878888 (Why is no real title available?)
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• A point-line incidence identity in finite fields, and applications
• Blocking sets
• Expander graphs and their applications
• Finite field Kakeya and Nikodym sets in three dimensions
• Finite geometry and combinatorial applications
• Hyperplane coverings and blocking sets
• Incidence bounds for block designs
• Interlacing eigenvalues and graphs
• Large incidence-free sets in geometries
• Multiple Blocking Sets and Arcs in Finite Planes
• Note on the existence of large minimal blocking sets in Galois planes
• Notes on semiarcs
• On large minimal blocking sets in PG(2,q)
• On semi ovals and semi ovoids
• On small complete arcs in a finite plane
• Polarities in finite projective planes
• Sets of type \((m,n)\) in the affine and projective planes of order nine
• Small complete arcs in projective planes
• Some \(p\)-ranks related to orthogonal spaces
• Some new results on sets of type (m,n) in projective planes
• Spectra of graphs
• The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
• The return of the Baer subplane
• Unitals in projective planes
• Unitäre Polaritäten endlicher projektiver Ebenen

Cited in

(12)

• On monoid graphs
• Generalizing Korchmáros-Mazzocca arcs
• Unique reducibility of multiple blocking sets
• On sensitivity in bipartite Cayley graphs
• scientific article; zbMATH DE number 3958110 (Why is no real title available?)
• A geometric characterization of minimal codes and their asymptotic performance
• Minimum blocking configurations
• Large blocking sets in \(\mathrm{PG}(2,q^2)\)
• Small Strong Blocking Sets by Concatenation
• Triangle-free induced subgraphs of the unitary polarity graph
• A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
• On multiple blocking sets in Galois planes

This page was built for publication: Minimal multiple blocking sets

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