English

Groups with maximal irredundant covers and minimal blocking sets

Group Theory 2009-01-14 v1 Combinatorics

Abstract

Let nn be a positive integer. Denote by PG(n,q)\mathrm{PG}(n,q) the nn-dimensional projective space over the finite field Fq\mathbb{F}_q of order qq. A blocking set in PG(n,q)\mathrm{PG}(n,q) is a set of points that has non-empty intersection with every hyperplane of PG(n,q)\mathrm{PG}(n,q). A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if PG(ni,q)\mathrm{PG}(n_i,q) contains a minimal blocking set of size kik_i for i{1,2}i\in\{1,2\}, then PG(n1+n2+1,q)\mathrm{PG}(n_1+n_2+1,q) contains a minimal blocking set of size k1+k21k_1+k_2-1. This result is proved by a result on groups with maximal irredundant covers.

Keywords

Cite

@article{arxiv.0901.1793,
  title  = {Groups with maximal irredundant covers and minimal blocking sets},
  author = {Alireza Abdollahi},
  journal= {arXiv preprint arXiv:0901.1793},
  year   = {2009}
}

Comments

to appear in Ars Combinatoria

R2 v1 2026-06-21T12:00:15.559Z