On Whitehead's first free-group algorithm, cutvertices, and free-product factorizations

arXiv1704.05338MaRDI QIDQ6285641FDOQ6285641

Warren Dicks

Publication date: 18 April 2017

Abstract: Let $F$ be any finite-rank free group, and $R$ be any finite subset of $g,[g]:ginF-1$, where $[g]:=fg{f}^{-1}:finF$. By an $R$-allocating $F$-factorization we mean a set $mathcalH$ of nontrivial subgroups of $F$ such that $as{t}_{HinmathcalH}H=F$ and $Rsubseteqh,[h]:hinH,HinmathcalH$. We show that Whitehead's (fast) cutvertex algorithm inputs the pair $(F,R)$ and outputs a maximum-size $R$-allocating $F$-factorization. Richard Stong showed this in the case where $RsubseteqF$ or $Rsubseteq[g]:ginF$, thereby unifying and generalizing a collection of results obtained by Berge, Bestvina, Lyon, Shenitzer, Stallings, Starr, and Whitehead. Our proof is based on the interaction between two normal forms for the elements of $F$, rather than the algebraic topology of handlebodies, trees, or graph folding.

This page was built for publication: On Whitehead's first free-group algorithm, cutvertices, and free-product factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285641)