The Generation Problem in Thompson Group 𝐹
From MaRDI portal
Publication:6201440
Abstract: We show that the generation problem in Thompson group is decidable, i.e., there is an algorithm which decides if a finite set of elements of generates the whole . The algorithm makes use of the Stallings -core of subgroups of , 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 -core of subgroups of provides a solution to another algorithmic problem in . Namely, given a finitely generated subgroup of , it is decidable if acts transitively on the set of finite dyadic fractions . Other applications of the study include the construction of new maximal subgroups of of infinite index, among which, a maximal subgroup of infinite index which acts transitively on the set and the construction of an elementary amenable subgroup of which is maximal in a normal subgroup of .
Recommendations
- scientific article; zbMATH DE number 3487529
- scientific article; zbMATH DE number 3080938
- scientific article; zbMATH DE number 3407754
- Eine Bemerkung zum Satz von Vitali über Konvergenz von Funktionenfolgen: Dem stets hilftsbereiten Herrn Kollegen H. L. Schmid, gewidmet
- scientific article; zbMATH DE number 1839786
- Holomorphic mappings of complex manifolds
- scientific article; zbMATH DE number 5593209
- On \(\varepsilon\)-representations
- scientific article; zbMATH DE number 3148394
Cites work
- scientific article; zbMATH DE number 140331 (Why is no real title available?)
- A RESIDUALLY FINITE VERSION OF RIPS'S CONSTRUCTION
- A geometric classification of some solvable groups of homeomorphisms
- A minimal non-solvable group of homeomorphisms.
- An algebraic classification of some solvable groups of homeomorphisms.
- Combinatorial algebra: syntax and semantics. With contributions by Victor S. Guba and Mikhail V. Volkov
- Combinatorial group theory.
- Conjugacy and dynamics in Thompson's groups.
- Determining solubility for finitely generated groups of PL homeomorphisms
- Diagram groups
- Diagram groups and directed 2-complexes: homotopy and homology.
- Distortion of wreath products in some finitely presented groups.
- ELEMENTARY AMENABLE SUBGROUPS OF R. THOMPSON'S GROUP F
- Finiteness properties of groups
- Implementation of a solution to the conjugacy problem in Thompson's group \(F\).
- Introductory notes on Richard Thompson's groups
- Invariable generation of Thompson groups
- On Jones' subgroup of R. Thompson group F
- On subgroups of R. Thompson's group $ F$ and other diagram groups
- On subgroups of R. Thompson's group \(F\)
- On the stabilizers of finite sets of numbers in the R. Thompson group \(F\)
- On the topological full group of a minimal Cantor \(\mathbb Z^2\)-system
- Random generation of Thompson group \(F\)
- Random subgroups of Thompson's group \(F\).
- Schreier graphs of actions of Thompson's group \(F\) on the unit interval and on the Cantor set
- Some amenable diffeomorphism groups of the interval
- Some graphs related to Thompson's group \(F\).
- Some unitary representations of Thompson's groups F and T
- Subgroups of small Cancellation Groups
- The conjugacy problem in extensions of Thompson's group \(F\)
- The simultaneous conjugacy problem in groups of piecewise linear functions.
- Thompson's group F$F$ is almost 32$\frac{3}{2}$‐generated
- Thompson’s Group and Public Key Cryptography
Cited in
(2)
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)
