Groups with maximal irredundant covers and minimal blocking sets
| dc.creator | Abdollahi, Alireza | |
| dc.date | 2009-01-13 | |
| dc.date.accessioned | 2026-07-07T12:28:58Z | |
| dc.date.available | 2026-07-07T12:28:58Z | |
| dc.description | Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with every hyperplane of $\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 $\mathrm{PG}(n_i,q)$ contains a minimal blocking set of size $k_i$ for $i\in\{1,2\}$, then $\mathrm{PG}(n_1+n_2+1,q)$ contains a minimal blocking set of size $k_1+k_2-1$. This result is proved by a result on groups with maximal irredundant covers. | |
| dc.description | to appear in Ars Combinatoria | |
| dc.identifier | https://arxiv.org/abs/0901.1793 | |
| dc.identifier | http://arxiv.org/abs/0901.1793 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215721 | |
| dc.subject | Group Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 20D60; 51E21 | |
| dc.title | Groups with maximal irredundant covers and minimal blocking sets | |
| dc.type | text |