Related papers: Connected reversible Mealy automata of prime size …
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
It was conjectured in [KLS14] that non-elementary word hyperbolic groups are never invariably generated. We show that this is indeed the case even for the much larger class of convergence groups.
We show that Einstein--Podolsky--Rosen--Bohm (EPR) and Greenberger--Horne--Zeilinger--Mermin (GHZ) states can not generate, through local manipulation and in the asymptotic limit, all forms of three--partite pure--state entanglement in a…
In this paper, we prove that the maximal order of a semiregular element in the automorphism group of a cubic vertex-transitive graph X does not tend to infinity as the number of vertices of X tends to infinity. This gives a solution (in the…
We give a new proof that free Burnside groups of sufficiently large even exponents are infinite. The method is very flexible and can also be used to study (partially) periodic quotients of any group which admits an action on a hyperbolic…
We give a new characterization of primitive permutation groups tied to the notion of completely reachable automata. Also, we introduce sync-maximal permutation groups tied to the state complexity of the set of synchronizing words of certain…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…
It is undecidable whether the language recognized by a probabilistic finite automaton is empty. Several other undecidability results, in particular regarding problems about matrix products, are based on this important theorem. We present…
In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…
For each prime $p$ we construct a family $\{G_i\}$ of finite $p$-groups such that $|\Aut (G_i)|/|G_i|$ goes to $0$, as $i$ goes to infinity. This disproves a well-known conjecture that $|G|$ divides $|\Aut(G)|$ for every non-abelian finite…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
The rotation group is formulated based on the abstract $B(X)$-module framework. Although the infinitesimal generators of rotation group include differential operators, the rotation group is formulated utilizing the framework of bounded…
We observe a criterion for groups to have vanishing virtual first Betti number and use it to give infinitely many examples of torsion-free, finitely generated, residually finite groups which aren't virtually diffuse. This answers a question…
In 1934, Garrett Birkhoff has shown that the number of isomorphism classes of finite metabelian groups of order $p^{22}$ tends to infinity with $p$. More precisely, for each prime number $p$ there is a family…
We prove that an outer automorphism of the free group is exponentially growing if and only if it induces an outer automorphism of infinite order of free Burnside groups with sufficiently large odd exponent.
The structure groups of non-degenerate symmetric set-theoretical solutions of the quantum Yang-Baxter equation provide an infinite family of Garside groups with many interesting properties. Given a non-degenerate symmetric solution, we…
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.
We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…