Groups with maximal irredundant covers and minimal blocking sets
Group Theory
2009-01-14 v1 Combinatorics
Abstract
Let be a positive integer. Denote by the -dimensional projective space over the finite field of order . A blocking set in is a set of points that has non-empty intersection with every hyperplane of . A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if contains a minimal blocking set of size for , then contains a minimal blocking set of size . This result is proved by a result on groups with maximal irredundant covers.
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