arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.2282math.GRmath.CO
收藏

PG(n,2)中的极小阻塞集与子群的覆叠群

Minimal blocking sets in PG(n,2) and covering groups by subgroups

Alireza Abdollahi, M. J. Ataei, A. Mohammadi Hassanabadi

摘要:

本文证明了PG(n,2)的点集$B$是极小阻塞集当且仅当$B$是$<B>=PG(d,2)$的点集,且$B$是$PG(d,2)$的$d+2$点集,且它们的$d+1$不在同一超平面上.作为后一个结果的推论,我们证明了:如果$G$是有限2-群且$n$是正整数,则$G$允许$\mathfrak{C}_{n+1}$ -覆盖当且仅当$n$是偶数且$G\cong (C_2)^{n}$,其中,对于群$H$的$\mathfrak{C}_m$ -覆盖,我们表示$H$的极大子群的大小为$m$的集合$\mathcal{C}$,其集合-理论并是整个$H$,没有$\mathcal{C}$的真子集具有后一性质,极大子群的交是无核的.同样对于所有$n<10$,我们找到所有对$(m,p)$($m>0$是整数,$p$是素数),对于这些对,存在$PG(m,p)$中大小为$n$的阻塞集$B$,使得$<B>=PG(m,p)$。

英文摘要:

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the latter result we show that if $G$ is a finite 2-group and $n$ is a positive integer, then $G$ admits a $\mathfrak{C}_{n+1}$-cover if and only if $n$ is even and $G\cong (C_2)^{n}$, where by a $\mathfrak{C}_m$-cover for a group $H$ we mean a set $\mathcal{C}$ of size $m$ of maximal subgroups of $H$ whose set-theoretic union is the whole $H$ and no proper subset of $\mathcal{C}$ has the latter property and the intersection of the maximal subgroups is core-free. Also for all $n<10$ we find all pairs $(m,p)$ ($m>0$ an integer and $p$ a prime number) for which there is a blocking set $B$ of size $n$ in $PG(m,p)$ such that $<B>=PG(m,p)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑