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

We prove that the number of iterations taken by the Weisfeiler-Lemanalgorithm for configurations coming from Schreier graphs is closely linked tothe diameter of the graphs themselves: an upper bound is found for generalSchreier graphs, and a lower bound holds for particular cases, such as forSchreier graphs with $G=\mbox{SL}_{n}({\mathbb F}_{q})$ ($q>2$) acting on$k$-tuples of vectors in ${\mathbb F}_{q}^{n}$; moreover, an exact expressionis found in the case of Cayley graphs.

The Weisfeiler-Leman algorithm and the diameter of Schreier graphs