We prove the existence and give constructions of a -fold perfect resolvable -Mendelsohn design for any integers with $v \equiv 1 \mod kKv\phik$, where is the least prime factor of . Such a design admits $K \rtimes \langle \phi \ranglek$ is a prime. As an application we prove that for any integer $v = p_{1}^{e_1} \ldots p_{t}^{e_t} \ge 3kp_{i}^{e_i} - 11 \le i \le t(v, k, 1)$-Mendelsohn design that admits a Frobenius group as a group of automorphisms. We also prove that, if is even and divides for , then there are at least resolvable $(v, k, 1)$-Mendelsohn designs that admit a Frobenius group as a group of automorphisms, where is Euler’s totient function.

生成讲解博客的中文版本

生成AI智能校验的中文版本