Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\).

DOI10.1016/j.jalgebra.2005.11.016zbMath1115.20032arXivmath/0410616MaRDI QIDQ2509265

Jennifer Taback, Murray J. Elder, Sean Cleary

Publication date: 19 October 2006

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0410616

zbMATH Keywords

generating sets; regular languages; Thompson group \(F\); lamplighter groups; counter languages; geodesic cone types

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20F05: Generators, relations, and presentations of groups

20F65: Geometric group theory

20F06: Cancellation theory of groups; application of van Kampen diagrams

Related Items

Unusual geodesics in generalizations of Thompson's group \(F\)., Random Sampling of Trivial Words in Finitely Presented Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
• On groups whose word problem is solved by a counter automaton.
• The combinatorial structure of cocompact discrete hyperbolic groups
• Introductory notes on Richard Thompson's groups
• Complete growth functions of hyperbolic groups
• Minimal length elements of Thompson's group \(F\)
• Thompson's group \(F\) is not almost convex.
• Automatic structures, rational growth, and geometrically finite hyperbolic groups
• Growth of Positive Words in Thompson's GroupF
• FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F
• ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F
• Combinatorial properties of Thompson’s group 𝐹
• Dead end words in lamplighter groups and other wreath products
• The lamplighter group as a group generated by a 2-state automaton, and its spectrum