THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
DOI10.1142/S0218196704001980zbMath1088.20016arXivmath/0204292OpenAlexW2071283394MaRDI QIDQ4658702
Publication date: 18 March 2005
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0204292
word problemdistortionsinfinite simple groupscomplexitiesDehn functionsThompson groupsCuntz algebrasfinitely presented simple groupsword-lengths
Selfadjoint operator algebras ((C^*)-algebras, von Neumann ((W^*)-) algebras, etc.) (46L99) Simple groups (20E32) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction which can be used to produce finitely presented infinite simple groups
- A finitely presented simple group with unsolvable conjugacy problem
- The complexity of Grigorchuk groups with application to cryptography
- Simple \(C^*\)-algebras generated by isometries
- Constructing inverse semigroups from category actions
- An application of polycyclic monoids to rings
- Constructing finitely presented simple groups that contain Grigorchuk groups
- Isoperimetric and isodiametric functions of groups
- Isoperimetric functions of groups and computational complexity of the word problem
- Word Problems Solvable in Logspace
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS