arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.7455math.CO
收藏

可分解Mendelsohn设计与有限弗罗贝尼乌斯群

Resolvable Mendelsohn designs and finite Frobenius groups

D. F. Hsu, Sanming Zhou

摘要:

证明了$(p(k)-1)$ -fold完美可分解$(v, k, 1)$ -Mendelsohn设计的存在性,并给出了其构造,其中$(p(k)-1)$ -fold完美可分解$(v, k, 1)$ -Mendelsohn设计对任意具有$v \equiv 1 \mod k$的整数$v > k \ge 2$,使得存在一个有限Frobenius群,其核$K$的阶为$v$,其补群包含一个阶为$k$的元素$ϕ$,其中$p(k)$是$k$的最小素因子.这样的设计允许$K \rtimes \langle ϕ\rangle$作为一组自同构,并且当$k$是素数时是完美的。作为一个应用,我们证明了对于任意整数$v = p_{1}^{e_1} \ldots p_{t}^{e_t} \ge 3$的素因子分解,以及任意素数$k$除$p_{i}^{e_i} - 1$为$1 \le i \le t$,存在可分解的完美$(v, k, 1)$ -Mendelsohn设计,其中Frobenius群是自同构群.我们还证明了,如果$k$是偶数,并划分$p_{i} - 1$为$1 \le i \le t$,那么至少有$φ(k)^t$可分解的$(v, k, 1)$ -Mendelsohn设计,承认Frobenius群作为一组自同构,其中$φ$是欧拉的totient函数。

英文摘要:

We prove the existence and give constructions of a $(p(k)-1)$-fold perfect resolvable $(v, k, 1)$-Mendelsohn design for any integers $v > k \ge 2$ with $v \equiv 1 \mod k$ such that there exists a finite Frobenius group whose kernel $K$ has order $v$ and whose complement contains an element $ϕ$ of order $k$, where $p(k)$ is the least prime factor of $k$. Such a design admits $K \rtimes \langle ϕ\rangle$ as a group of automorphisms and is perfect when $k$ is a prime. As an application we prove that for any integer $v = p_{1}^{e_1} \ldots p_{t}^{e_t} \ge 3$ in prime factorization, and any prime $k$ dividing $p_{i}^{e_i} - 1$ for $1 \le i \le t$, there exists a resolvable perfect $(v, k, 1)$-Mendelsohn design that admits a Frobenius group as a group of automorphisms. We also prove that, if $k$ is even and divides $p_{i} - 1$ for $1 \le i \le t$, then there are at least $φ(k)^t$ resolvable $(v, k, 1)$-Mendelsohn designs that admit a Frobenius group as a group of automorphisms, where $φ$ is Euler's totient function.

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

↑