Computability of Følner sets

Abstract

We define the notion of computability of Følner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has computable Følner sets. We also prove computability of Følner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable Følner sets with subrecursive distortion function. Moreover we obtain some known and some new upper bounds for the Følner function in these particular extensions.

13 pages

Cited by in corpus (4)

• Følner functions and the generic Word Problem for finitely generated amenable groups
• Fluctuation bounds for ergodic averages of amenable groups
• Sofic profiles of $S(\omega )$ and computability
• Amenability and computability