Isomorphism versus commensurability for a class of finitely presented groups.

DOI10.1515/JGT-2013-0050MaRDI QIDQ3190446zbMATH OpenOpenAlexFDO

Authors Jean-François Lafont, Ashot Minasyan, Goulnara N. Arzhantseva

Publication date 17 September 2014

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.2225, https://eprints.soton.ac.uk/338952/1/isom-6.pdf

zbMATH Keywords

commensurability of groupscommensurability problemfinitely presented groupsisomorphism problemrecursively enumerable classessubgroups of finite indexword problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability problem is solvable but the isomorphism problem is unsolvable. These are first examples of such a contrastive complexity behaviour with respect to the isomorphism problem.

Recommendations

• The conjugacy and isomorphism problems for combable groups.
• The commensurability relation for finitely generated groups.
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
• The Word Problem Versus the Isomorphism Problem
• The isomorphism problem for profinite completions of finitely presented, residually finite groups.

Cited in

(16)

• The conjugacy and isomorphism problems for combable groups.
• Isomorphism classification of Leary-Minasyan groups
• Isomorphism of finitely generated solvable groups is weakly universal.
• On the isomorphism of some groups with one defining relation.
• On suspensions and conjugacy of hyperbolic automorphisms
• Uncountably many non-commensurable finitely presented pro-p groups.
• Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V
• Comparison of Commuting One-Parameter Groups of Isometries
• The commensurability relation for finitely generated groups.
• scientific article; zbMATH DE number 940926 (Why is no real title available?)
• On the outer automorphism groups of finitely generated, residually finite groups.
• Isomorphism of uniform algebras on the 2-torus
• Isomorphism theorems for classes of cyclically presented groups
• scientific article; zbMATH DE number 5040031 (Why is no real title available?)
• On the isomorphism problem for split extensions
• On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups.

This page was built for publication: Isomorphism versus commensurability for a class of finitely presented groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190446)