Related papers: Cross-wired lamplighter groups and linearity of au…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

We prove that the torsion-free lamplighter group $\Gamma = \mathbb{Z}^n \wr \mathbb{Z}$ of any rank $n \in \mathbb{N}$ is profinitely rigid in the absolute sense: the finite quotients of $\Gamma$ determine its isomorphism type uniquely…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

Let $G_{p,d}$ be the restricted wreath product $C_{p} wr C^{d}$ where $C_{p}$ is a cyclic group of order a prime $p$ and $C^{d}$ a free abelian group of finite rank $d$. We study the existence of faithful state-closed (fsc) representations…

We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular…

We introduce the concept of crossed product of a product system by a locally compact group. We prove that the crossed product of a row-finite and faithful product system by an amenable group is also a row-finite and faithful product system.…

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a…

In this paper, we introduce a new technique in the study of the $*$-regular closure of some specific group algebras $KG$ inside $\mathcal{U}(G)$, the $*$-algebra of unbounded operators affiliated to the group von Neumann algebra…

In this paper, we describe a regular representation given by Cayley theorem for 2-crossed modules of groups and their associated Gray 3-group groupoids with a single 0-cell and equivalently cat2-groups.

We prove that any finitely generated torsion free solvable subgroup of the group ${\rm IET}$ of all Interval Exchange Transformations is virtually abelian. In contrast, the lamplighter groups $A\wr \mathbb{Z}^k$ embed in ${\rm IET}$ for…

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…

Let $G$ be a group and let $A$ be a finite-dimensional vector space over an arbitrary field $K$. We study finiteness properties of linear subshifts $\Sigma \subset A^G$ and the dynamical behavior of linear cellular automata $\tau \colon…

Let G be a free group in a variety of groups, but G is not absolutely free. We prove that the group of automorphisms Aut(G) is linear iff G is a virtually nilpotent group.

The zero divisor conjecture is sufficient to prove for certain class of finitely presented groups where the relations are given by a pairing of generators. We associate Mealy automata to such pairings, and prove that the zero divisor…

We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…

Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…

We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…

We study groups acting on CAT(0) square complexes. In particular we show if Y is a nonpositively curved (in the sense of A. D. Alexandrov) finite square complex and the vertex links of Y contain no simple loop consisting of five edges, then…

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…