Dead ends on wreath products and lamplighter groups
Eduardo Silva
Abstract
Eduardo Silva
Abstract
For any finite group A and any finitely generated group B, we prove that the corresponding lamplighter group [Formula: see text] admits a standard generating set with unbounded depth, and that if B is abelian then the above is true for every standard generating set. This generalizes the case where [Formula: see text] together with its cyclic generator [S. Cleary and J. Taback, Dead end words in lamplighter groups and other wreath products, Q. J. Math. 56(2) (2005) 165–178]. When [Formula: see text] is the free product of two finite groups H and K, we characterize which standard generators of the associated lamplighter group have unbounded depth in terms of a geometrical constant related to the Cayley graphs of H and K. In particular, we find differences with the one-dimensional case: the lamplighter group over the free product of two sufficiently large finite cyclic groups has uniformly bounded depth with respect to some standard generating set.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For any finite group A and any finitely generated group B, we prove that the corresponding lamplighter group [Formula: see text] admits a standard generating set with unbounded depth, and that if B is abelian then the above is true for every standard generating set. This generalizes the case where [Formula: see text] together with its cyclic generator [S. Cleary and J. Taback, Dead end words in lamplighter groups and other wreath products, Q. J. Math. 56(2) (2005) 165–178]. When [Formula: see text] is the free product of two finite groups H and K, we characterize which standard generators of the associated lamplighter group have unbounded depth in terms of a geometrical constant related to the Cayley graphs of H and K. In particular, we find differences with the one-dimensional case: the lamplighter group over the free product of two sufficiently large finite cyclic groups has uniformly bounded depth with respect to some standard generating set.
Key concepts: Mathematics, Generating set of a group, Wreath product, Cyclic group, Abelian group, Free product, Cayley graph, Combinatorics