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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We show that the isomorphism problem is solvable in at most exponential time for a class of one-relator groups which is exponentially generic in the sense of Ol’shanskii. This is obtained by applying the Arzhantseva-Ol’shanskii graph minimization method to prove the general result that for fixed integers m≥2 and n≥1 there is an exponentially generic class of non-free m-generator n-relator groups with the property that there is only one Nielsen equivalence class of m-tuples which generate a non-free subgroup. In particular, every m-generated subgroup in such a generic group G is either free or is equal to G itself and such groups are thus co-Hopfian. These results are obtained by elementary methods without using the deep results of Sela about co-Hopficity and the isomorphism problem for torsion-free hyperbolic groups.

Genericity, the Arzhantseva-Ol?shanskii method and the isomorphism problem for one-relator groups