Automatic groups associated with word orders other than shortlex
Sarah Rees
Abstract
The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups associated with other word orders (the algorithm has now been implemented ) and reports on the use of the algorithm for specific examples; in particular a very natural automatic (or asynchonously automatic) structure for the Baumslag-Solitar and related classes of groups (closely related to one described for some of those groups by Epstein et al. is found from a wreath product order over shortlex.
Create a lesson
Related papers
Property R∞ for Artin and Coxeter groups whose outer automorphisms are length-preserving
Ignat Soroko
DL, DQ Spectrum and Eigenvalue-free Interval of Cayley Graphs over Finite Nilpotent Groups
Pallabi Manna, Santanu Mandal
On p-groups with one nonlinear codegree
Jiwei Zheng, Heng Lv
Classes of Subgroups of a finite group with isomorphic quotient groups
Tushar Halder, Sachin Ballal
Cohomology and multiplicative gaps for quasi-isometries of nilpotent groups
Mayukh Mukherjee, Soumyadeb Samanta, Soumyadip Thandar
On the number of conjugacy classes of finite solvable groups of order divisible by p2
Thomas Michael Keller