Related papers: On finitely generated submonoids of virtually free…
We prove (using grammars) that the free inverse monoid of every finite rank has co-context-free word problem. Equivalently, the co-word problem of the free inverse monoid of every finite rank is context-free.
We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…
The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…
In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…
We prove that an infinite-ended group whose one-ended factors have finite-index subgroups and are in a family of groups with a nonzero multiplicative invariant is not quasi-isometrically rigid. Combining this result with work of the first…
If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications…
We obtain a number of finiteness results for groups acting on Gromov-hyperbolic spaces. In particular we show that a torsion-free locally quasiconvex hyperbolic group has only finitely many conjugacy classes of $n$-generated one-ended…
We show that any subgroup of a finitely generated virtually abelian group $G$ grows rationally relative to $G$, that the set of right cosets of any subgroup of $G$ grows rationally, and that the set of conjugacy classes of $G$ grows…
We give two examples of a finitely generated subgroup of a free group and a subset, closed in the profinite topology of a free group, such that their product is not closed in the profinite topology of a free group.
A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…
We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…
The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…
We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…
Rodaro and Silva proved that the fixed points submonoid and the periodic points submonoid of a trace monoid endomorphism are always finitely generated. We show that for finitely generated left preGarside monoids, that includs finitely…