Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups

DOI10.1080/00927870701715639zbMath1147.51006arXiv0708.2282OpenAlexW2964284648MaRDI QIDQ5456491

No author found.

Publication date: 8 April 2008

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.2282

zbMATH Keywords

blocking setscovering groups by subgroupsmaximal irredundant covers for groups

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Blocking sets, ovals, (k)-arcs (51E21)

Cites Work

• Unnamed Item
• Unnamed Item
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• Hyperplane coverings and blocking sets
• On the size of a blocking set in \(\text{PG}(2,p)\)
• Proper blocking sets in projective spaces
• Covering groups with subgroups
• Groups as the union of proper subgroups.
• On $n$-Sum Groups.
• Groups with a Maximal Irredundant 6-Cover
• On 1-blocking sets in \(PG(n,q), n\geq 3\)
• Packing and covering groups with subgroups

This page was built for publication: Minimal Blocking Sets inPG(n, 2) and Covering Groups by Subgroups