Computability of Følner sets

DOI10.1142/S0218196717500382zbMath1483.20060arXiv1606.04293OpenAlexW3101760780MaRDI QIDQ4596402

Matteo Cavaleri

Publication date: 1 December 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

word problemFølner setsamenable groupsFølner function

Mathematics Subject Classification ID

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)

Følner functions and the generic word problem for finitely generated amenable groups ⋮ Computable paradoxical decompositions ⋮ Sofic profiles of \(S(\omega)\) and computability ⋮ Partial word and equality problems and Banach densities ⋮ 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
• A quasi-isometric embedding theorem for groups.
• Fast growth in the Følner function for Thompson's group \(F\).
• Piecewise automatic groups.
• Entropy and isoperimetry for linear and non-linear group actions.
• On isoperimetric profiles of finitely generated groups.
• Combinatorial group theory.
• Følner functions and the generic word problem for finitely generated amenable groups
• Algorithmically complex residually finite groups
• Random walks on free solvable groups
• Relative subgroup growth and subgroup distortion
• Topological dimension and dynamical systems. Translated from the French by the author
• Cellular Automata and Groups
• Solvable groups with polynomial Dehn functions
• Følner Nets for Semidirect Products of Amenable Groups

This page was built for publication: Computability of Følner sets