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

An algorithm is given tjat recognises (in  O(lN  2  log  N ) time, where  N  is the size of the input and  l  the depth of a precalculated Schreier tree) when a transitive group, ( G , Ω) is the action on one orbit of the action of  G  on the set Γ( 2 ) of ordered pairs of distinct elements of some  G -set Γ (that us, Ωis isomorphic to an orbital of ( G ,Γ)). This may be adapted to list all essentially different such actions in  O ( lN 4  log  N )time, where  N  is the sum of sizes of the input and output. This will be a useful tool for reducing the degree of a permutation group as an aid to further study of the group.  This algorithm is then extended to provide an algorithm that will (in  O (l N 3   log  N ) time) recognise when a transiteve group is the action on one orbit of the action of  G  on the set Γ {2}  ofunorderd pairs of distinct elements of some  G -set Γ. An algorithm for finding all essentially different such actions is also provided, running in  O ( lN 4  log N ) time. (again,  N  is the sum of the input and output sizes.) It is also indicated how these results may be applied to the more general problem of recognising when an intransitive group ( G ,Ω) is isomorphic to ( G , Γ {2} ) for some  G -set Γ.  All the algorithms are practical; most have been implementd in GAP, and the code is made available with this paper. In some cases the algorithms are considerably more practical than their asymptotic analyses would suggest.

Algorithmic Recognition of Group Actions on Orbitals