On the size of a blocking set in PG(2,p)

DOI10.1007/BF01305953MaRDI QIDQ1323481zbMATH OpenOpenAlexWikidataFDO

Authors Aart Blokhuis

Publication date 2 January 1995

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01305953

zbMATH Keywords

blocking setconjecture of Di PaolaDesarguesian projective planeprojective planes

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Desarguesian and Pappian geometries (51A30) Finite affine and projective planes (geometric aspects) (51E15) Blocking sets, ovals, (k)-arcs (51E21)

Review text

This short and elementary note contains a proof of the following: the size of a non-trivial blocking set in \(\text{PG}(2,p)\), the Desarguesian projective plane of order \(p\), where \(p\) is prime, is at least \(3(p+1)/2\), and this bound can be achieved. (A non-trivial blocking set in \(\text{PG}(2,p)\) is such that any line intersects it, but is not contained in it.) This settles a 25 years old conjecture of Di Paola. This contrasts other results for projective planes of order \(q\). If \(q\) is a square, the tight bound is \(q+ \sqrt q+1\), established by \textit{A. A. Bruen} [SIAM J. Appl. Math. 21, 380-392 (1971; Zbl 0252.05014)]. If the projective plane is Desarguesian, it is at least \(q+ \sqrt{2q}+ 1\), as proved by the author and \textit{A. E. Brouwer} [Bull. Lond. Math. Soc. 18, 132-134 (1986; Zbl 0563.05016)].

Recommendations

• Blocking Sets in Desarguesian Projective Planes
• Blocking sets in Desarguesian affine and projective planes
• Minimal blocking sets of size \(2p-2\) and \(2p-3\) in \(PG(2, p)\), \(p\) prime and \(p > 5\)
• Blocking sets of size \(q^t + q^{t-1} + 1\)

Cites work

• Arcs and blocking sets. II
• Blocking Sets in Finite Projective Planes
• Covering finite fields with cosets of subspaces
• On Minimum Blocking Coalitions in Small Projective Plane Games
• The blocking number of an affine space

Cited in

(61)

• Random constructions and density results
• Tight sets, weighted m-covers, weighted m-ovoids, and minihypers
• Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
• Blocking sets in Desarguesian affine and projective planes
• On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
• The return of the Baer subplane
• The packing problem in statistics, coding theory and finite projective spaces
• Blocking sets of almost Rédei type
• A remark on blocking sets of almost Rédei type
• Proper blocking sets in projective spaces
• On small complete arcs in a finite plane
• On the size of a double blocking set in \(\text{PG}(2,q)\)
• On the blocking sets in S(3,6,22) and S(4,7,23)
• On a particular class of minihypers and its applications. II: Improvements for \(q\) square
• Tight sets in finite classical polar spaces
• On a particular class of minihypers and its applications. III: Applications
• On the size of a triple blocking set in \(\text{PG} (2,q)\)
• A small minimal blocking set in \(\mathrm{PG}(n,p^t)\), spanning a \((t-1)\)-space, is linear
• On the size of the smallest non-classical blocking set of Rédei type in \(PG (2, p)\)
• Block size in geometric(\(p\))-biased permutations
• The characterization of cones as pointsets with 3 intersection numbers
• Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics
• A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound
• On the minimum size of complete arcs and minimal saturating sets in projective planes
• Parameters for which the Griesmer bound is not sharp
• On the spectrum of the sizes of maximal partial line spreads in \(\mathrm{PG}(2n,q)\), \(n \geq 3\)
• Blocking sets in \(\text{PG}(2,q^n)\) from cones of \(\text{PG}(2n,q)\)
• Open problems in finite projective spaces
• New lower bounds for the Turán density of PG_m(q)
• On the extendability of particular classes of constant dimension codes
• Minimal Symmetric Differences of Lines in Projective Planes
• scientific article; zbMATH DE number 997667 (Why is no real title available?)
• Blocking Sets in Desarguesian Projective Planes
• On the stability of small blocking sets
• Semiarcs with long secants
• On q-analogues and stability theorems
• Directed PBDs with Block Sizes from K Where K
• Small maximal partial \(t\)-spreads in \(\mathrm{PG}(2t+1 , q)\)
• Nonintersecting Ryser Hypergraphs
• Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups
• On the smallest minimal blocking sets of \(Q(2n,q)\), for \(q\) an odd prime
• On 1-blocking sets in \(PG(n,q), n\geq 3\)
• Packing and covering groups with subgroups
• Plane curves giving rise to blocking sets over finite fields
• TANGENT-FILLING PLANE CURVES OVER FINITE FIELDS
• On the upper chromatic number and multiple blocking sets of PG(n,q)
• Most plane curves over finite fields are not blocking
• Small point sets of \(\text{PG}(n,p^{3h})\) intersecting each line in 1 mod \(p^{h}\) points
• On sets without tangents and exterior sets of a conic
• A stability theorem for lines in Galois planes of prime order
• Prime power residues and blocking sets
• Non-uniform lines on finite projective planes
• Proportion of blocking curves in a pencil
• Avoiding secants of given size in finite projective planes
• The geometry of codes for random access in DNA storage
• Cameron-Liebler sets of generators in the Klein quadric Q^+(5,q)
• Generalized Hamming weights of additive codes and geometric counterparts
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
• Small proper double blocking sets in Galois planes of prime order
• Partial covers of \(\mathrm{PG}(n, q)\)

This page was built for publication: On the size of a blocking set in \(\text{PG}(2,p)\)

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