Groups with maximal irredundant covers and minimal blocking sets.
From MaRDI portal
Publication:2936722
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.
Recommendations
- On 1-blocking sets in \(PG(n,q), n\geq 3\)
- Lower bounds for the cardinality of minimal blocking sets in projective spaces
- Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
- On the non-trivial minimal blocking sets in binary projective spaces
- Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups
Cited in
(3)
This page was built for publication: Groups with maximal irredundant covers and minimal blocking sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936722)