The Generation Problem in Thompson Group 𝐹

From MaRDI portal
Publication:6201440

DOI10.1090/MEMO/1451arXiv1608.02572OpenAlexW4388781955MaRDI QIDQ6201440FDOQ6201440


Authors: Gili Golan Polak Edit this on Wikidata


Publication date: 20 February 2024

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Abstract: We show that the generation problem in Thompson group F is decidable, i.e., there is an algorithm which decides if a finite set of elements of F generates the whole F. The algorithm makes use of the Stallings 2-core of subgroups of F, which can be defined in an analogue way to the Stallings core of subgroups of a finitely generated free group. Further study of the Stallings 2-core of subgroups of F provides a solution to another algorithmic problem in F. Namely, given a finitely generated subgroup H of F, it is decidable if H acts transitively on the set of finite dyadic fractions mathcalD. Other applications of the study include the construction of new maximal subgroups of F of infinite index, among which, a maximal subgroup of infinite index which acts transitively on the set mathcalD and the construction of an elementary amenable subgroup of F which is maximal in a normal subgroup of F.


Full work available at URL: https://arxiv.org/abs/1608.02572




Recommendations




Cites Work






This page was built for publication: The Generation Problem in Thompson Group 𝐹

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201440)