Related papers: From automatic structures to automatic groups
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…
Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…
We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…
Any abstract (not necessarily continuous) group automorphism of a simple, compact Lie group must be continuous due to Cartan (1930) and van der Waerden (1933). The purpose of this paper is to study a similar question in nilpotent Lie…
Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…
Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…
An automorphism of a group G is called an IA-automorphism if it induces the identity automorphism on the abelianized group G/G'. Let IA(G) denote the group of all IA-automorphisms of G. We classify all finitely generated nilpotent groups G…
In this paper we address the problem of quantitative classification of Cayley automatic groups in terms of a certain numerical characteristic which we earlier introduced for this class of groups. For this numerical characteristic we…
Cellular automata (CA) are well-studied models of decentralized parallel computation, known for their ability to exhibit complex global behavior from simple local rules. While their dynamics have been widely explored through simulations, a…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA…
A Cayley object for a group G is a structure on which G acts regularly as a group of automorphisms. The main theorem asserts that a necessary and sufficient condition for the free abelian group G of rank m to have the generic n-tuple of…
Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.