Title of article
Cone types and geodesic languages for lamplighter groups and Thompsonʹs group F
Author/Authors
Sean Cleary، نويسنده , , Murray Elder، نويسنده , , Jennifer Taback، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
25
From page
476
To page
500
Abstract
We study languages of geodesics in lamplighter groups and Thompsonʹs group F. We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group is not counter but is context-free, while with respect to another generating set the full language of geodesics is counter and context-free. In Thompsonʹs group F with respect to the standard finite generating set, we show there are infinitely many cone types and that there is no regular language of geodesics. We show that the existence of families of “seesaw” elements with respect to a given generating set in a finitely generated infinite group precludes a regular language of geodesics and guarantees infinitely many cone types with respect to that generating set.
Keywords
Thompsonיs group F , Lamplighter groups , Counter automata , Context-free grammar , Cone type , regular language , Rational growth
Journal title
Journal of Algebra
Serial Year
2006
Journal title
Journal of Algebra
Record number
697656
Link To Document