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

Zendy Tools

Zendy Open

Given a black-box group G isomorphic to some finite simple group of Lie type and the characteristic of G, we compute the standard name of G by a Monte Carlo algorithm. The running time is polynomial in the input length and in the time requirement for the group op- erations in G. The algorithm chooses a relatively small number of (nearly) uniformly distributed random elements of G, and examines the divisibility of the orders of these elements by certain primitive prime divisors. We show that the divisibility statistics determine G, except that we cannot dis- tinguish the groups PWð2m þ 1; qÞ and PSpð2m; qÞ in this manner when q is odd and m d 3. These two groups can, however, be distinguished by using an algorithm of Altseimer and Borovik.

Black-box recognition of finite simple groups of Lie type by statistics of element orders