Related papers: Whitehead algorithm for automorphisms of generaliz…
A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS…
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group $G$ which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually…
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…
We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…
Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses…
A rank $n$ generalized Baumslag-Solitar group is a group that splits as a finite graph of groups such that all vertex and edge groups are isomorphic to $\mathbb{Z}^n$. In this paper we classify these groups in terms of their separability…
We investigate fixed subgroups of automorphisms of generalised Baumslag-Solitar (GBS) groups. Our main results are for automorphisms leaving a Bass-Serre tree invariant, under the assumption that all edge stabilisers are strictly contained…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
We develop a refinement of Whitehead's algorithm for primitive words in a free group. We generalize to subgroups, establishing a strengthened version of Whitehead's algorithm for free factors. We make use of these refinements in proving new…
Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…
In this article, we study the space of subgroups of generalized Baumslag-Solitar groups (GBS groups), that is, groups acting cocompactly on an oriented tree without inversion and with infinite cyclic vertex and edge stabilizers. Our results…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
Let $F$ be any finite-rank free group, and $R$ be any finite subset of $\{g, [g]: g \in F-\{1\}\}$, where $[g]:= \{fgf^{-1}:f\in F\}$. By an $R$-allocating $F$-factorization we mean a set $\mathcal{H}$ of nontrivial subgroups of $F$ such…
We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…
We prove that there is an algorithm to determine whether a tuple of elements in a toral relatively hyperbolic group G is in the automorphic orbit of the other tuple.
Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…
Let $G$ be a generalized Baumslag-Solitar group and $\mathcal{C}$ be a class of groups containing at least one non-unit group and closed under taking subgroups, extensions, and Cartesian products of the form $\prod_{y \in Y}X_{y}$, where…
Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…