Department of

January 2017 February 2017 March 2017 Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 4 5 6 7 1 2 3 4 1 2 3 4 8 9 10 11 12 13 14 5 6 7 8 9 10 11 5 6 7 8 9 10 11 15 16 17 18 19 20 21 12 13 14 15 16 17 18 12 13 14 15 16 17 18 22 23 24 25 26 27 28 19 20 21 22 23 24 25 19 20 21 22 23 24 25 29 30 31 26 27 28 26 27 28 29 30 31

Tuesday, February 7, 2017

**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 free group. An application of the algorithm shows that F is a cyclic extension of a group K which has a maximal elementary amenable subgroup B. The group B is a copy of a subgroup of F constructed by Brin and Navas.