Related papers: Orbit-blocking words in free groups

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…

In a number of recent works, it has been established that many virtually free groups, almost all fundamental groups of surfaces and all groups which are nontrivial free products of groups satisfying a non-trivial law are algebraically…

Any virtually free group $H$ containing no non-trivial finite normal subgroup (e.g., the infinite dihedral group) is a retract of any finitely generated group containing $H$ as a verbally closed subgroup.

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…

Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special…

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…

We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

We prove a freeness theorem for low-rank subgroups of one-relator groups. Let $F$ be a free group, and let $w\in F$ be a non-primitive element. The primitivity rank of $w$, $\pi(w)$, is the smallest rank of a subgroup of $F$ containing $w$…

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.

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is said to be concise if w(G) is finite whenever the set of w-values in G is finite. In the sixties P. Hall asked whether…

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

We use Gersten's generalization of Whitehead's algorithm to determine whether a given finitely generated subgroup of a free group $F$ is elliptic in an elementary cyclic splitting of $F$. We provide a similar result for all elementary…

It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…