Computability of F{\o}lner sets
Group Theory
2018-07-04 v2
Abstract
We define the notion of computability of F{\o}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{\o}lner sets. We also prove computability of F{\o}lner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable F{\o}lner sets with subrecursive distortion function. Moreover we obtain some known and some new upper bounds for the F{\o}lner function in these particular extensions.
Cite
@article{arxiv.1606.04293,
title = {Computability of F{\o}lner sets},
author = {Matteo Cavaleri},
journal= {arXiv preprint arXiv:1606.04293},
year = {2018}
}
Comments
13 pages