On decidability of amenability in computable groups

DOI10.1007/S00153-022-00819-5MaRDI QIDQ2085571zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 October 2022

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-022-00819-5

zbMATH Keywords

amenabilitycomputable groupsintrinsically computable relations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Amenability, definable groups, and automorphism groups
• Decidability and computability of certain torsion-free abelian groups
• scientific article; zbMATH DE number 3916533
• On amenability of automata groups.
• Amenability of groups and G-sets
• Finitely \(\mathcal{F}\)-amenable actions and decomposition complexity of groups
• scientific article; zbMATH DE number 713389
• On effective Birkhoff's ergodic theorem for computable actions of amenable groups
• On elementary amenable bounded automata groups
• Amenable actions and exactness for discrete groups

Cites work

• An Embedding Theorem for Finitely Generated Groups
• Aspects of free groups.
• Cellular automata and groups
• Computability of Følner sets
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Diophantine geometry over groups. I: Makanin-Razborov diagrams
• Elementary theory of free non-abelian groups.
• Følner functions and the generic word problem for finitely generated amenable groups
• Group Embeddings with Algorithmic Properties
• Groups with the Haagerup property. Gromov's a-T-menability
• scientific article; zbMATH DE number 3732033 (Why is no real title available?)
• scientific article; zbMATH DE number 67424 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 1302872 (Why is no real title available?)
• Hyperlinear and Sofic Groups: A Brief Guide
• Kazhdan's property
• Limit groups as limits of free groups.
• On effective Birkhoff's ergodic theorem for computable actions of amenable groups
• On subgroups of free Burnside groups of large odd exponent.
• Possible degrees in recursive copies. II
• RANDOM WALKS ON FREE PERIODIC GROUPS
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• Subgroup properties of fully residually free groups
• SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
• The Banach-Tarski paradox
• The conjugacy problem and Higman embeddings
• Turing computability. Theory and applications

Cited in

(3)

• Computable paradoxical decompositions
• Amenability and computability
• The submonoid and rational subset membership problems for graph groups.

This page was built for publication: On decidability of amenability in computable groups

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