相关论文: The lamplighter group of rank two generated by a b…

We construct a bireversible self-dual automaton with $3$ states over an alphabet with $3$ letters which generates the lamplighter group $\mathbb{Z}_3\wr\mathbb{Z}$.

For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.

For any nontrivial abelian group $\mathbb{X}$ we construct a reversible (bireversible in case the order of $\mathbb{X}$ is odd) automaton such that its set of states and alphabet are identified with $\mathbb{X}$, transition and output…

We realize lamplighter groups $A\wr \mathbb Z$, with $A$ a finite abelian group, as automaton groups via affine transformations of power series rings with coefficients in a finite commutative ring. Our methods can realize $A\wr \mathbb Z$…

We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations…

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…

We are following [4]. Nevertheless we are interested only in claryfication that the lamplighter group can be realized as a 2--states Mealy machine.

We show presentations of automata groups generated by Cayley machines of finite groups of nilpotency class two and these automata groups are all cross-wired lamplighters.

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.

We consider the two generalizations of lamplighter groups: automata groups generated by Cayley machine and cross-wired lamplighter groups. For a finite step two nilpotent group with central squares, we study its associated Cayley machine…

Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

We prove that finite lamplighter groups $\{\mathbb{Z}_2\wr\mathbb{Z}_n\}_{n\ge 2}$ with a standard set of generators embed with uniformly bounded distortions into any non-superreflexive Banach space, and therefore form a set of test-spaces…

It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable…

We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…

We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

We show that the higher rank lamplighter groups, or Diestel-Leader groups $\Gamma_d(q)$ for $d \geq 3$, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.