Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On wreath product occurring as subgroup of automata group (2405.16678v1)

Published 26 May 2024 in math.GR

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

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com