Related papers: Groups generated by 3-state automata over a 2-lett…
In this article we present an extensive survey on the developments in the theory of non-abelian finite groups with abelian automorphism groups, and pose some problems and further research directions.
Formal languages based on the multiplication tables of finitely generated groups are investigated and used to give a linguistic characterization of word hyperbolic groups.
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
We describe the autotopism group Atp(G) of any abelian group G as being a semidirect product of its automorphism group Aut(G) and G^2. We then provide the subgroup structure of Atp(G) when G is a finite cyclic group.
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…
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…
We give a complete and irredundant list of the finite groups $G$ for which Aut$(G)$, acting naturally on $G$, has precisely $3$ orbits. There are 7 infinite families: one abelian, one non-nilpotent, three families of non-abelian $2$-groups…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.
In this paper we consider the set ${\mathbb Z}^{\pm\omega}_{6}$ of two-way infinite words $\xi$ over the alphabet $\{0,1,2,3,4,5\}$ with the integer left part $\lfloor\xi\rfloor$ and the fractional right part $\{\xi\}$ separated by a radix…
The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is…
We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.
We classify gradings by arbitrary abelian groups on the classical simple Lie superalgebras $P(n)$, $n \geq 2$, and on the simple associative superalgebras $M(m,n)$, $m, n \geq 1$, over an algebraically closed field: fine gradings up to…
In this note we give a characterization of elementary abelian 2-groups in terms of their maximal sum-free subsets.
Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…
We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.