COMPUTING WORD LENGTH IN ALTERNATE PRESENTATIONS OF THOMPSON'S GROUP F

DOI10.1142/S0218196709005445zbMath1214.20041arXiv0706.3218OpenAlexW2963826258MaRDI QIDQ3406717

Matthew Horak, Melanie Stein, Jennifer Taback

Publication date: 19 February 2010

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

presentationsCayley graphsgenerating setsword lengthsword metricsThompson group \(F\)almost convex groupspockets

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65)

Related Items

Tame combing and almost convexity conditions.

Cites Work

• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• Almost convex groups
• Solvable Baumslag-Solitar groups are not almost convex.
• Minimal length elements of Thompson's group \(F\)
• Thompson's group \(F\) is not almost convex.
• Almost convex groups and the eight geometries
• FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F
• THE UNBOUNDED DEAD-END DEPTH PROPERTY IS NOT A GROUP INVARIANT
• ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F
• Combinatorial properties of Thompson’s group 𝐹
• A finitely presented group with unbounded dead-end depth
• Dead end words in lamplighter groups and other wreath products

This page was built for publication: COMPUTING WORD LENGTH IN ALTERNATE PRESENTATIONS OF THOMPSON'S GROUP F