2000 character limit reached
On Maximal Subgroups of Thompson's Group
Published 7 Sep 2022 in math.GR | (2209.03244v2)
Abstract: We study subgroups of Thompson's group by means of an automaton associated with them. We prove that every maximal subgroup of of infinite index is closed, that is, it coincides with the subgroup of accepted by the automaton associated with it. It follows that every finitely generated maximal subgroup of is undistorted in . We also prove that every finitely generated subgroup of is contained in a finitely generated maximal subgroup of and construct an infinite family of non-isomorphic maximal subgroups of infinite index in .
Paper Prompts
Sign up for free to create and run prompts on this paper.