Related papers: Reading Off Kurosh Decompositions
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
We re-cast in a more combinatorial and computational form the foldings approach of John Stallings and pursue a detailed study of the subgroup structure of free groups. In particular, we introduce the notions of an "algebraic" and a "free"…
In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…
We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…
A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…
We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stalling's folding process in time O(N log^*(N)), where N is the sum of the word lengths of the given generators of H.
For a subgroup of a free product of finite groups, we obtain necessary conditions (on its Kurosh decomposition) to be verbally closed.
The celebrated Stallings' decomposition theorem states that the splitting of a finite index subgroup $H$ of a finitely generated group $G$ as an amalgamated free product or an HNN-extension over a finite group implies the same for $G$. We…
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
The paper is concerned with Kropholler's conjecture on splitting a finitely generated group over a codimension-1 subgroup. For a subgroup H of a group G, we define the notion of "finite splitting height" which generalises the finite-height…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
We describe a procedure to deform cubulations of hyperbolic groups by "bending hyperplanes". Our construction is inspired by related constructions like Thurston's Mickey Mouse example, walls in fibred hyperbolic $3$-manifolds and…
Suppose that $F$ is a free group and $k$ is a natural number. We show that the fully compressed membership problem for $k$-generated subgroups of $F$ is solvable in polynomial time. In order to do this, we adapt the theory of Stallings'…
A JSJ-splitting of a group $G$ over a certain class of subgroups is a graph of groups decomposition of $G$ which describes all possible decompositions of $G$ as an amalgamated product or an HNN extension over subgroups lying in the given…
This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of…
In this paper, we streamline the technique of groupoids coarse decomposition for purpose of K-theory computations of groupoids crossed products. This technique was first introduced by Guoliang Yu in his proof of Novikov conjecture for…
We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
When two free factors A and B of a free group F_n are in "general position" we define the projection of B to the splitting complex (alternatively, the complex of free factors) of A. We show that the projections satisfy properties analogous…