The Generation Problem in Thompson Group $F$ LN *Instructive ""Try This"" activities at

*Instructive ""Try This"" activities at the end of each chapter for teacher study groups and professional development

teachers will find thorough

you will not be able to put it down

care home staff

The Generation Problem in Thompson Group $F$ LN *Instructive ""Try This"" activities atWe show that the generation problem in Thompson's 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 analogous 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