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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G$ be a finite group, and write ${\rm cd}(G)$ for the degree set of thecomplex irreducible characters of $G$. The group $G$ is said to satisfy the{\it two-prime hypothesis} if, for any distinct degrees $a, b \in {\rm cd}(G)$,the total number of (not necessarily different) primes of the greatest commondivisor ${\rm gcd}(a, b)$ is at most $2$. In this paper, we prove an upperbound on the number of irreducible character degrees of a nonsolvable groupthat has a composition factor isomorphic to ${\rm PSL}_2 (q)$ for $q \geq 7$.

Groups satisfying the two-prime hypothesis with a composition factor isomorphic to ${\rm PSL}_2(q)$ for $q\geq 7$