Related papers: Translation equivalent elements in free groups

In this paper we study the probability that two elements selected at random with replacement from a given finite semigroup act the same by right translation on the semigroup, that is, the chosen elements have the same right matrix.

J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

A palindrome in a free group F_n is a word on some fixed free basis of F_n that reads the same backwards as forwards. The palindromic automorphism group \Pi A_n of the free group F_n consists of automorphisms that take each member of some…

In 1976 S. Shelah posed the following problem: for which variety V of algebras the automorphism group of any free algebra F from V of "large" infinite rank interprets by means of first-order logic set theory (according to his results, for…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

Let $F_n$ be the free group on $n\ge 2$ elements and $\A(F_n)$ its group of automorphisms. In this paper we present a rich collection of linear representations of $\A(F_n)$ arising through the action of finite index subgroups of it on…

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 that if $G_\phi=\langle F, t| t x t^{-1} =\phi(x), x\in F\rangle$ is the mapping torus group of an injective endomorphism $\phi: F\to F$ of a free group $F$ (of possibly infinite rank), then every two-generator subgroup $H$ of…

Let $G$ be either a profinite or a connected compact group, and $\Gamma, \Lambda$ be finitely generated dense subgroups. Assuming that the left translation action of $\Gamma$ on $G$ is strongly ergodic, we prove that any cocycle for the…

A Houghton's group $\mathcal{H}_n$ consists of translations at infinity of a $n$ rays of discrete points on the plane. In this paper we study the growth rate of endomorphisms of Houghton's groups. We show that if the kernel of an…

The equaliser of a set of homomorphisms $S: F(a, b)\rightarrow F(\Delta)$ has rank at most two if $S$ contains an injective map, and is not finitely generated otherwise. This proves a strong form of Stallings' Equaliser Conjecture for the…

In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…

Let $G$ be a group and let ${\mathcal G}$ be a free factor system of $G$, namely a free splitting of $G$ as $G=G_1*\dots*G_k*F_r$. In this paper, we study the set of train track points for ${\mathcal G}$-irreducible automorphisms $\phi$…

This article focuses on free factors H <= F_m of the free group F_m with finite rank m > 2, and specifically addresses the implications of Ascari's refinement of the Whitehead automorphism phi for H as introduced in \cite{ascari2021fine}.…

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…

In this paper, we will discuss the groups generated by two Heisenberg translations of ${\rm PSp}(2,1)$ and determine when they are free. We improve a result given in \cite{xwy} by Xie, Wang, Jiang in Canad. Math. Bull. $56(2013), 881-889.$…