Related papers: A characterization of those automata that structur…
The main result of this paper is that the outer automorphism group of a free product of finite groups and cyclic groups is semistable at infinity (provided it is one ended) or semistable at each end. In a previous paper, we showed that the…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
A theorem of Myasnikov and Roman'kov says that any verbally closed subgroup of a finitely generated free group is a retract. We prove that all free (and many virtually free) verbally closed subgroups are retracts in any finitely generated…
To every dynamical system $(X,\varphi)$ over a totally disconnected compact space, we associate a left-orderable group $T(\varphi)$. It is defined as a group of homeomorphisms of the suspension of $(X,\varphi)$ which preserve every orbit of…
Let $G$ be a finite non-cyclic group. The non-cyclic graph $\Gamma_G$ of $G$ is the graph whose vertex set is $G\setminus Cyc(G)$, two distinct vertices being adjacent if they do not generate a cyclic subgroup, where $Cyc(G)=\{a\in G:…
We show that V(A(T)) does not have definable principal subcongruences or bounded Maltsev depth. When the Turing machine T halts, V(A(T)) is an example of a finitely generated semilattice based (and hence congruence meet-semidistributive)…
In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.
The role of finite centralizers of involutions in pseudo-finite groups is analyzed. It is shown that a pseudo-finite group admitting a definable involutory automorphism fixing only finitely many elements is finite-by-abelian-by-finite. As a…
The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
Let Gamma be a finitely generated, amenable group. Using an idea of E Ghys, we prove that if Gamma has a nontrivial, orientation-preserving action on the real line, then Gamma has an infinite, cyclic quotient. (The converse is obvious.)…
Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent…
We prove that for arbitrary two finitely generated subgroups A and B having infinite index in a free group F, there is a subgroup H of finite index in B such that the subgroup generated by A and H has infinite index in F. The main corollary…
A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
Existing research gives conditions for when the outer automorphism group of a graph product of primary cyclic groups $W_\Gamma$ is finite, virtually abelian, or large. We seek to prove a set of conditions for when this outer automorphism…
It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…
The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…