Følner functions and the generic word problem for finitely generated amenable groups

DOI10.1016/j.jalgebra.2018.06.017zbMath1427.20037arXiv1703.04133OpenAlexW2603535217MaRDI QIDQ1663531

Matteo Cavaleri

Publication date: 21 August 2018

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.04133

zbMATH Keywords

word problemFølner functionsdiscrete amenable groupseffective amenabilitygeneric computabilitygeneric equality problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Means on groups, semigroups, etc.; amenable groups (43A07)

Related Items (7)

Computable paradoxical decompositions ⋮ Sofic profiles of \(S(\omega)\) and computability ⋮ Partial word and equality problems and Banach densities ⋮ Computability of Følner sets ⋮ Fluctuation bounds for ergodic averages of amenable groups ⋮ Graph automaton groups ⋮ On decidability of amenability in computable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quasi-isometric embedding theorem for groups.
• Fast growth in the Følner function for Thompson's group \(F\).
• Algorithmically finite groups.
• Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups.
• Exponentially generic subsets of groups
• Piecewise automatic groups.
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Group-based cryptography
• Entropy and isoperimetry for linear and non-linear group actions.
• A small simplification in hyperbolic groups
• The class of groups all of whose subgroups with lesser number of generators are free is generic
• Generic-case complexity, decision problems in group theory, and random walks.
• On isoperimetric profiles of finitely generated groups.
• Algorithmically complex residually finite groups
• Speed of random walks, isoperimetry and compression of finitely generated groups
• Random walks on free solvable groups
• Topological dimension and dynamical systems. Translated from the French by the author
• Generic computability, Turing degrees, and asymptotic density
• THE WORD PROBLEM
• Generic complexity of undecidable problems
• Cellular Automata and Groups
• ALMOST EVERY GROUP IS HYPERBOLIC
• Computability of Følner sets
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS

This page was built for publication: Følner functions and the generic word problem for finitely generated amenable groups