Papers
Topics
Authors
Recent
Search
2000 character limit reached

On wreath product occurring as subgroup of automata group

Published 26 May 2024 in math.GR | (2405.16678v1)

Abstract: A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated abelian group $A$, the wreath product $A \wr G$ is a subgroup of an automata group. We obtain, for example, that $C_2 \wr (C_{2} \wr \mathbb{Z})$, $\mathbb{Z} \wr (C_2 \wr \mathbb{Z})$, $C_2 \wr (\mathbb{Z} \wr \mathbb{Z})$, and $\mathbb{Z} \wr (\mathbb{Z} \wr \mathbb{Z})$ are subgroups of automata groups. In the particular case $\mathbb{Z} \wr (\mathbb{Z} \wr \mathbb{Z})$, we prove that it is a subgroup of a two-letters automata group; this solves Problem 15.19 - (b) of the Kourovka Notebook proposed by A. M. Brunner and S. Sidki in 2000 [8, 17].

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.