Related papers: Nonstandard Cayley automatic representations of fu…
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…
It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…
In this paper we describe the new model of the representations of the current groups with a semisimple Lie group of the rank one. In the earlier papers of 70-80-th (Araki, Gelfand-Graev-Vershik) had posed the problem about irreducible…
This article is devoted to the investigation of semidirect products of groups of loops and groups of diffeomorphisms of finite and infinte dimensional real, complex and quaternion manifolds. Necessary statements about quaternion manifolds…
We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
We determine two new infinite families of Cayley graphs that admit colour-preserving automorphisms that do not come from the group action. By definition, this means that these Cayley graphs fail to have the CCA (Cayley Colour Automorphism)…
Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
We consider the two generalizations of lamplighter groups: automata groups generated by Cayley machine and cross-wired lamplighter groups. For a finite step two nilpotent group with central squares, we study its associated Cayley machine…
Continuous wavelet transforms arising from the quasiregular representation of a semidirect product of a vector group with a matrix group -- the so-called dilation group -- have been studied by various authors. Recently the attention has…
In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation…
One of pressing problems in mathematical physics is to find a generalized Poincar\'e symmetry that could be applied to nonflat space-times. As a step in this direction we define the semidirect product of groupoids $\Gamma_0 \rtimes…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
In this paper, we describe the automorphism group of semidirect product of two groups that fixes the non-normal subgroup of it. We have computed these automorphisms for the non-abelian metacyclic $p$-group and non-abelian $p$-groups $(p\ge…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
The subdirect product of two finite groups $A$ and $B$ is defined as a subgroup of the direct product $A \times B$, which is a well-known notion in finite group theory. While it is clear that, under appropriate choices of sets of generators…
This article presents a machinery based on polyhedral products that produces faithful representations of graph products of finite groups and direct products of finite groups into automorphisms of free groups $\rm Aut(F_n)$ and outer…
We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…