Virtually free groups are stable in permutations

13.04.2021 15:00 - 17:00

Nir Lazarovich (Technion)

Roughly speaking, a group is stable in permutations if every almost action on a finite set is almost an action. We prove that 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. Joint work with Arie Levit.

G. Arzhantseva, A. Evetts
Join online at link below, using Chrome. Password: the order of the smallest non-abelian simple group.