Related papers: Some solvable automaton groups

We introduce two series of finite automata starting from the so-called Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the…

For $0<\alpha\le 1$, we say that a sequence $(X_k)_{k>0}$ of $d$-regular graphs has property $D_\alpha$ if there exists a constant $C>0$ such that $\mathrm{diam}(X_k)\ge C\cdot|X_k|^\alpha$. We investigate property $D_\alpha$ for arithmetic…

We canonically identify the groups of isometries and dilations of local fields and their rings of integers with subgroups of the automorphism group of the $(d+1)$-regular tree $\widetilde T_{d+1}$, where $d$ is the residual degree. Then we…

Every automaton group naturally acts on the space $X^\omega$ of infinite sequences over some alphabet $X$. For every $w\in X^\omega$ we consider the Schreier graph $\Gamma_w$ of the action of the group on the orbit of $w$. We prove that for…

The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

We give an example of a subgroup of SL(2,C) which is a strictly ascending HNN extension of a non-abelian finitely generated free group F. In particular, we exhibit a free group F in SL(2,C) of rank 6 which is conjugate to a proper subgroup…

We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the…

Our main result is that many triangles of Baumslag-Solitar groups collapse to finite groups, generalizing a famous example of Hirsch. A triangle of Baumslag-Solitar groups means a group with three generators, cyclically ordered, with each…

Besides the oscillator group, there is another four-dimensional non-abelian solvable Lie group that admits a bi-invariant pseudo-Riemannian metric. It is called split oscillator group (sometimes also hyperbolic oscillator group or Boidol's…

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 consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We prove that the limits of Baumslag-Solitar groups which we previously studied are non-linear hopfian C*-simple groups with infinitely many twisted conjugacy classes. We exhibit infinite presentations for these groups, classify them up to…

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…

A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…

A general algebraic condition for the functional independence of 2n-1 constants of motion of an n-dimensional maximal superintegrable Hamiltonian system has been proved for an arbitrary finite n. This makes it possible to construct, in a…

We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…