English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We prove the existence and give constructions of a $(p(k)-1)$-fold perfectresolvable $(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 $\phi$ of order $k$,where $p(k)$ is the least prime factor of $k$. Such a design admits $K \rtimes\langle \phi \rangle$ as a group of automorphisms and is perfect when $k$ is aprime. As an application we prove that for any integer $v = p_{1}^{e_1} \ldotsp_{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 ofautomorphisms. We also prove that, if $k$ is even and divides $p_{i} - 1$ for$1 \le i \le t$, then there are at least $\varphi(k)^t$ resolvable $(v, k,1)$-Mendelsohn designs that admit a Frobenius group as a group ofautomorphisms, where $\varphi$ is Euler's totient function.

Resolvable Mendelsohn designs and finite Frobenius groups