Related papers: Automatic groups, subgroups and cosets
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions…
We introduce the concept of cyclicity and hypercyclicity in self-similar groups as an analogue of cyclic and hypercyclic vectors for an operator on a Banach space. We derive a sufficient condition for cyclicity of non-finitary automorphisms…
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
We study from a physics viewpoint a class of generative neural nets, Gibbs machines, designed for gradual learning. While including variational auto-encoders, they offer a broader universal platform for incrementally adding newly learned…
An operation of joining coset diagrams for a given group, introduced by Higman and developed by Conder in connection with Hurwitz groups, is reinterpreted and generalised as a connected sum operation on dessins d'enfants of a given type. A…
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…
The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…
The notion of representative statistical ensembles, correctly representing statistical systems, is strictly formulated. This notion allows for a proper description of statistical systems, avoiding inconsistencies in theory. As an…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…
In this paper we review some of the fundamental properties of the free group and give a detailed account of Stallings's theory of automata, a geometric interpretation of its subgroups that has been (and still is) immensely fruitful, both as…
By a result of Gersten and Short finite presentations satisfying the usual non-metric small cancellation conditions present biautomatic groups. We show that in the case in which all pieces have length one, a generalization of the C(3)-T(6)…
We present new results regarding automatic continuity, unifying some diagonalization concepts that have been developed over the years. For example, any homomorphism from a completely metrizable topological group to Thompson's group $F$ has…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
In this note the usual Goursat lemma, which describes subgroups of the direct product of two groups, is generalized to describing subgroups of a direct product $A_1\times A_2 \times...\times A_n$ of a finite number of groups. Other possible…