Virtually free groups are stable in permutations
Nir Lazarovich
Technion – Israel Institute of Technology, Haifa, IsraelArie Levit
Tel Aviv University, Israel
Abstract
We prove that finitely generated virtually free groups are stable in permutations. As an application, we show that almost-periodic almost-automorphisms of labelled graphs are close to periodic automorphisms.
Cite this article
Nir Lazarovich, Arie Levit, Virtually free groups are stable in permutations. Groups Geom. Dyn. 17 (2023), no. 4, pp. 1417–1434
DOI 10.4171/GGD/735