where si∈π1(Γ, u0) is represented by the closed path whose only edge not contained in Y
is ei. Now the graph can be folded onto Rnusing Stallings folds [St] yielding a sequence
Γ=Γ0,Γ1,...,Γk−1,Γk=Rn
such that Γi+1 is obtained from Γiby a single Stalling fold pi. One observes that we can
define tuples (Γi, ui
0, Yi, Ei, fi) with fi+1 ◦pi=fifor all isuch that all tuples represent
the same Nielsen class. As the initial tuple defines Tand the terminal tuples defines the
standard basis, the theorem follows. Note that it is crucial that any folding sequence yields
essentially the same (folded) object. Thus there is only one Nielsen-class and therefore
there is no need to distinguish distinct classes.
A similar argument can be used to prove Grushko’s theorem [Gr] which states that
any generating tuple of a free product A∗Bis Nielsen equivalent to a tuple of the
form (a1, . . . , ak, b1, . . . , bl). This argument relies on folding sequences in the category
of (marked) graphs of groups with trivial edge groups, see [Du] and [BF] where folding
sequences for graphs of groups were studied. In this case one obtains a sequence of graphs
of groups with trivial edge groups where each vertex is marked with a generating tuple of
its vertex group and where the terminal object is the 1-edge graph of groups corresponding
to the free product A∗Band the vertices are marked with generating tuples of (a1, . . . , ak)
of Aand (b1, . . . , bl) of B, respectively. Unlike in the case of free groups, the terminal
object is not unique, however in the case of irreducible generating tuples it was shown in
[W2] that any terminal object that occurs is marked by generating tuples (a0
1, . . . , a0
k) and
(b0
1, . . . , b0
l) that are Nielsen-equivalent to (a1, . . . , ak) and (b1, . . . , bl), respectively. This
implies the strongest possible uniqueness result for the output of Grushko’s theorem. The
simple but somewhat subtle idea underlying the proof in [W2] relies on considering appro-
priate equivalence classes of marked graphs or groups (or more precisely A-graphs) to be
vertices where vertices are connected by edges if one can be obtained by the other by a
fold. The result then follows by observing connectivity of the graph and establishing that
there is unique vertex of minimal complexity.
The proofs of Louder [Lou] and Dutra [Dut] can be thought of as a variation of the
proof of Grushko, but in a different category. It is shown that any Nielsen equivalence
class of irreducible generating tuples is represented by a folded object which represents a
standard generating tuple in the case of surfaces (Louder) or is a special marking in the
case of sufficiently large cone type 2-orbifolds. In the first case the uniqueness is then
immediate and in the second case it follows if all cone points are of order 2. The main
objective of this paper is to show that in the second case the folded object is unique up
to the appropriate equivalence. To do so we broadly follow the strategy of [W2], however
both the language developed and the arguments applied are significantly more involved.
We will use the language of A-graph as developed in [KMW] and rely on a number
of results of [Dut]. Moreover a certain degree of familiarity with both of these papers is
assumed. Following Louder and Dutra we decompose the fundamental group of the orbifold
Ounder consideration as the fundamental group of a graph of groups Acorresponding to a
decomposition of Oalong essential simple closed curves. The paper has two main chapters,
Chapter 3 and Chapter 4:
1. In Chapter 3 we study generating tuples of fundamental groups of orbifolds with
boundary, those are the groups that occur as vertex groups of A. In Section 3.1 we
collect basic facts about Nielsen classes generating tuples, in particular we charac-
terize rigid generating tuples. In the subsequent sections we study finitely generated
subgroups of the vertex groups of Awhere some of the generators are assumed to
be peripheral, i.e. conjugate to elements of the adjacent edge groups. We study
these so-called partitioned tuples up to the natural equivalence. As the groups under
consideration are fundamental groups of graphs of groups with trivial edge groups
we can rely on a variation of the arguments from [W2] to prove Proposition 3.11,
5