Related papers: Multiplication tables and word-hyperbolicity in fr…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
Let $\Phi:F\rightarrow F$ be an automorphism of the finite-rank free group $F$. Suppose that $G=F\rtimes_\Phi\mathbb Z$ is word-hyperbolic. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.
We prove that ascending HNN extensions of free groups are word-hyperbolic if and only if they have no Baumslag-Solitar subgroups. This extends the theorem of Brinkmann that free-by-cyclic groups are word-hyperbolic if and only if they have…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.
We study the free objects in the variety of semigroups and variety of monoids generated by the monoid of all $n \times n$ upper triangular matrices over a commutative semiring. We obtain explicit representations of these, as multiplicative…
We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…
We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
We show that free products of sofic groups with amalgamation over monotileably amenable subgroups are sofic. Consequently, so are HNN extensions of sofic groups relative to homomorphisms of monotileably amenable subgroups. We also show that…
We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…
In this paper, we prove that infinite cancellative finitely generated hyperbolic monoids never contain $\mathbb N\times\mathbb N$ as a submonoid but that they contain an element of infinite order and, if they are elementary, then they also…
In this paper we obtain uniform positive lower bounds on stable commutator length in word-hyperbolic groups and certain groups acting on hyperbolic spaces (namely the mapping class group acting on the complex of curves, and an amalgamated…
We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…
The purpose of this paper is to extend some useful results, such as the multiplication being open, previously known for suitable finitely generated relatively free profinite semigroups, to relatively free profinite semigroupoids over…
We define hyperbolic groupoids, generalizing the notion of a Gromov hyperbolic group. Examples of hyperbolic groupoids include actions of Gromov hyperbolic groups on their boundaries, pseudogroups generated by expanding self-coverings,…
Two groups have a common model geometry if they act properly and cocompactly by isometries on the same proper geodesic metric space. The Milnor-Schwarz lemma implies that groups with a common model geometry are quasi-isometric; however, the…