Projects per year
Abstract
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskiĭ has finite order. A modification of the construction gives other undecidability results about the dynamics of the action of elements of 2V on Cantor space. Arzhantseva, Lafont, and Minasyanin proved in 2012 that there exists a finitely presented group with solvable word problem and unsolvable torsion problem. To our knowledge, 2V furnishes the first concrete example of such a group and gives an example of a direct undecidability result in the extended family of R. Thompson type groups.
Original language | English |
---|---|
Pages (from-to) | 3157-3172 |
Number of pages | 16 |
Journal | Transactions of the American Mathematical Society |
Volume | 369 |
Issue number | 5 |
Early online date | 27 Dec 2016 |
DOIs | |
Publication status | Published - May 2017 |
Keywords
- Undecidable torsion problem
- Brin-Thompson groups
- Rational group
- Transducer
- Reversible Turing machine
Fingerprint
Dive into the research topics of 'Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Automata Languages Decidability: Automata, Languages, Decidability in Algebra
Ruskuc, N. (PI) & Quick, M. (CoI)
1/03/10 → 31/05/14
Project: Standard
Profiles
-
Collin Patrick Bleak
- School of Mathematics and Statistics - Director of Impact
- Pure Mathematics - Reader
- Centre for Interdisciplinary Research in Computational Algebra
Person: Academic