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

A program computing isomorphisms between association schemes was applied to speed up the computation of normalizers of permutation groups. A transitive permutation group forms an association scheme while a permutation group which may not be transitive forms a coherent configuration. In this paper we discuss the extension of the above program to compute isomorphisms between coherent configurations and show some typical examples of computing normalizers.

Computation of isomorphisms of coherent configurations