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/

Zendy Plus

Presents the zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders ofelements of $G$. We present a polynomial-time algorithm that, given a finiteset $\mathcal M$ of positive integers, outputs either an empty set or a finitesimple group $G$. In the former case, there is no finite simple group $H$ with$\mathcal{M}=\omega(H)$, while in the latter case,$\mathcal{M}\subseteq\omega(G)$ and $\mathcal{M}\neq\omega(H)$ for all finitesimple groups $H$ with $\omega(H)\neq\omega(G)$.

The graph of atomic divisors and constructive recognition of finite simple groups