Isomorphism of finitely generated solvable groups is weakly universal.

DOI10.1016/J.JPAA.2014.07.002MaRDI QIDQ2254323zbMATH OpenOpenAlexFDO

Authors Jay Williams

Publication date 4 February 2015

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpaa.2014.07.002

zbMATH Keywords

finitely generated solvable groupsweakly universal countable Borel equivalences

Mathematics Subject Classification ID

Descriptive set theory (03E15) Applications of logic to group theory (20A15) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20)

Recommendations

• On the complexity of the isomorphism relation for finitely generated groups
• Beating the generator-enumeration bound for solvable-group isomorphism
• THE VIRTUAL ISOMORPHISM PROBLEM FOR FINITELY GENERATED GROUPS
• Isomorphism versus commensurability for a class of finitely presented groups.
• The commensurability relation for finitely generated groups.

Cites work

• Algorithmically complex residually finite groups
• Cantor systems, piecewise translations and simple amenable groups
• Embedding Theorems for Groups
• Full groups of Cantor minimal systems
• Full groups, flip conjugacy, and orbit equivalence of Cantor minimal systems
• Limit groups as limits of free groups.
• Martin's conjecture and strong ergodicity
• On the complexity of the isomorphism relation for finitely generated groups
• SOME REMARKS ON TOPOLOGICAL FULL GROUPS OF CANTOR MINIMAL SYSTEMS
• The action of \(SL(2,\mathbb{Z})\) on the subsets of \(\mathbb{Z} ^2\)
• The bi-embeddability relation for finitely generated groups
• Topological full groups of minimal subshifts and just-infinite groups

Cited in

(10)

• On the complexity of the isomorphism relation for finitely generated groups
• Finitely generated groups are universal among finitely generated structures
• Condensed groups in product varieties
• A topological zero-one law and elementary equivalence of finitely generated groups
• On the complexity of topological conjugacy of Toeplitz subshifts
• The bi-embeddability relation for finitely generated groups. II
• Isomorphisms, definable relations, and Scott families of class 2 nilpotent groups
• Uncountable structures are not classifiable up to bi-embeddability
• Finitely presented condensed groups
• On the first-order genus of wreath products and their central extensions

This page was built for publication: Isomorphism of finitely generated solvable groups is weakly universal.

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