Related papers: A connected 3-state reversible Mealy automaton can…
Recently, many classes of infinitely divisible distributions on R^d have been characterized in several ways. Among others, the first way is to use Levy measures, the second one is to use transformations of Levy measures, and the third one…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
We construct a hyperbolic group with a finitely presented subgroup, which has infinitely many conjugacy classes of finite-order elements. We also use a version of Morse theory with high dimensional horizontal cells and use handle…
It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands,…
Among restricted wreath products $G\wr \mathbb Z^k $, where $G$ is a finite Abelian group, we find three large classes of groups admitting an automorphism $\varphi$ with finite Reidemeister number $R(\varphi)$ (number of $\varphi$-twisted…
We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of an observation process driven by a sequential Mealy…
We show that every bounded automaton group can be embedded in a finitely generated, simple amenable group. The proof is based on the study of the topological full groups associated to the Schreier dynamical system of the mother groups. We…
We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the…
In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
We define a class of groups based on parallel computations by pushdown automata. This class generalizes automatic groups. It includes the fundamental groups of all 3-manifolds which obey Thurston' s geometrization conjecture. It also…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary…
The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.
This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…
We investigate initial information, unbounded memory and randomization in gathering mobile agents on a grid. We construct a state machine, such that it is possible to gather, with probability 1, all configurations of its copies. This…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
We develop a representative-level framework for the Liebscher-Tsirelson random-set construction of Arveson systems from stationary factorizing measure types. We introduce the notion of a measurable factorizing family of probability measures…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with three states which is rotation invariant and which uses \`a la Moore neighbourhood. Moreover, at each step of the computation, the set of non…