Related papers: Whitehead algorithm for automorphisms of generaliz…
Let $\mathcal{C}$ be a class of groups. A group $X$ is said to be residually a $\mathcal{C}$-group (conjugacy $\mathcal{C}$-separable) if, for any elements $x,y \in X$ that are not equal (not conjugate in $X$), there exists a homomorphism…
The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…
We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…
We generalize the combinatorial approaches of Rapaport and Higgins--Lyndon to the Whitehead algorithm. We show that for every automorphism $\varphi$ of a free group $F$ and every word $u\in F$ there exists a finite multiset of words…
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 Whitehead Minimization problem is a problem of finding elements of the minimal length in the automorphic orbit of a given element of a free group. The classical algorithm of Whitehead that solves the problem depends exponentially on the…
We characterize which groups splitting as finite graphs of free groups with cyclic edge groups are residually finite. Such a group $G$ is residually finite if and only if all its Baumslag-Solitar subgroups are residually finite. From a…
We characterise when a rank $n$ generalised Baumslag-Solitar group is CAT(0) and when it is biautomatic.
We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.
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…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
We call a finite group G ultrasolvable if it has a characteristic subgroup series whose factors are cyclic. It was shown by Durbin--McDonald that the automorphism group of an ultrasolvable group is supersolvable. The converse statement was…
In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…
A generalized Baumslag-Solitar group is the fundamental group of a graph of groups all of whose vertex and edge groups are infinite cyclic. Levitt proves that any generalized Baumslag-Solitar group has property R-infinity, that is, any…
By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…
Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…
We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and…
Let F_2 denote the free group of rank 2. Our main technical result of independent interest is: for any element u of F_2, there is g in F_2 such that no cyclically reduced image of u under an automorphism of F_2 contains g as a subword. We…
The mapping class group of a genus $g$ surface $\Sigma_{g,1}$ with one boundary component is known to have a simple yet infinite presentation with generators given by elementary moves called Whitehead moves on so-called marked bordered…
We introduce a new isomorphism invariant for generalized Baumslag-Solitar (GBS) groups, which we call the limit angle. Unlike previously known invariants, which are primarily algebraic, the limit angle admits a dynamical interpretation,…