
arXiv: 2209.03244
We study subgroups of Thompson’s group F by means of an automaton associated with them. We prove that every maximal subgroup of F of infinite index is closed , that is, it coincides with the subgroup of F accepted by the automaton associated with it. It follows that every finitely generated maximal subgroup of F is undistorted in F . We also prove that every finitely generated subgroup of F is contained in a finitely generated maximal subgroup of F and construct an infinite family of non-isomorphic maximal subgroups of infinite index in F .
closed subgroups, Maximal subgroups, FOS: Mathematics, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), maximal subgroups, Group Theory (math.GR), Geometric group theory, Mathematics - Group Theory, Thompson's groupf
closed subgroups, Maximal subgroups, FOS: Mathematics, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), maximal subgroups, Group Theory (math.GR), Geometric group theory, Mathematics - Group Theory, Thompson's groupf
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
