Related papers: Measuring closeness between Cayley automatic group…
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…
In this paper, we study the parallelism between perfect numbers and Leinster groups and continue it by introducing the new concepts of almost and quasi Leinster groups which parallel almost and quasi perfect numbers. These are small…
This survey purports to be an elementary introduction to compactly presented groups, which are the analogue of finitely presented groups in the broader realm of locally compact groups. In particular, compact presentation is interpreted as a…
According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their…
In this paper, we introduce a new technique in the study of the $*$-regular closure of some specific group algebras $KG$ inside $\mathcal{U}(G)$, the $*$-algebra of unbounded operators affiliated to the group von Neumann algebra…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As…
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable…
Approximate Bayesian Computation (ABC for short) is a family of computational techniques which offer an almost automated solution in situations where evaluation of the posterior likelihood is computationally prohibitive, or whenever…
In this article we introduce and study uniform and non-uniform approximate lattices in locally compact second countable (lcsc) groups. These are approximate subgroups (in the sense of Tao) which simultaneously generalize lattices in lcsc…
We construct a new family of Cayley automatic representations of semidirect products $\mathbb{Z}^n \rtimes_A \mathbb{Z}$ for which none of the projections of the normal subgroup $\mathbb{Z}^n$ onto each of its cyclic components is finite…
We introduce the notion of the Automatic Logarithm $\mathcal L_{\mathcal A, \mathcal B}$ with the purpose of studying the expanding properties of Schreier graphs of action of the group generated by two finite initial Mealy automata…
A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…
We characterise when a rank $n$ generalised Baumslag-Solitar group is CAT(0) and when it is biautomatic.
A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…
We give an introduction to the Cayley-Abels graph for a totally disconnected, locally compact (tdlc) group. It is a generalization of the Cayley graph. We illustrate that on the one hand, Cayley-Abels graphs are useful tools to extend…
We realize lamplighter groups $A\wr \mathbb Z$, with $A$ a finite abelian group, as automaton groups via affine transformations of power series rings with coefficients in a finite commutative ring. Our methods can realize $A\wr \mathbb Z$…
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$.…
The class of locally compact near abelian groups is introduced and investigated as a class of metabelian groups formalizing and applying the concept of scalar multiplication. The structure of locally compact near abelian groups and its…