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

It is shown that for graph groups (right-angled Artin groups) the conjugacyproblem as well as a restricted version of the simultaneous conjugacy problemcan be solved in polynomial time even if input words are represented in acompressed form. As a consequence it follows that the word problem for theouter automorphism group of a graph group can be solved in polynomial time.

Compressed conjugacy and the word problem for outer automorphism groups of graph groups