Related papers: Linearly Mismatched Free-by-Cyclic Groups are Asyn…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
Let $\mathcal{A}$ and $\mathcal{B}$ be two algebras and let $n$ be a positive integer. A linear mapping $D:\mathcal{A} \rightarrow \mathcal{B}$ is called a \emph{strongly generalized derivation of order $n$} if there exist families of…
A nonpolycyclic nilpotent-by-cyclic group Gamma can be expressed as the HNN extension of a finitely-generated nilpotent group N. The first main result is that quasi-isometric nilpotent-by-cyclic groups are HNN extensions of quasi-isometric…
Given a free-by-cyclic group $G = F_N \rtimes_\varphi \mathbb{Z}$ determined by any outer automorphism $\varphi \in \mathrm{Out}(F_N)$ which is represented by an expanding irreducible train-track map $f$, we construct a $K(G,1)$ $2$-complex…
We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…
We discuss cyclic star-autonomous categories; that is, unbraided star- autonomous categories in which the left and right duals of every object p are linked by coherent natural isomorphism. We settle coherence questions which have arisen…
A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…
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…
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…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
We show in this article that, for any group $G$ indecomposable for the free product * and non-isomorphic to $\mathbf{Z}$, the canonical inclusion ${\rm Aut}(G^{*n})\to {\rm Aut}(G^{* n+1})$ induces an isomorphism between the homology groups…
We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n,…
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…
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
The set of synchronizing words of a given $n$-state automaton forms a regular language recognizable by an automaton with $2^n - n$ states. The size of a recognizing automaton for the set of synchronizing words is linked to computational…
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…
An automaton is monotonic if its states can be arranged in a linear order that is preserved by the action of every letter. We prove that the problem of deciding whether a given automaton is monotonic is NP-complete. The same result is…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup…