A spelling theorem for staggered generalized 2-complexes, with applications (Q796648)

Let \(R=S^ n\) (\(n\geq 1)\) be a cyclically reduced word in a free group, where S is not a proper power. A Gurevich subword for R is a word of the form \(T^{n-1}T_ 1\), where T is a cyclic permutation of S or \(S^{- 1}\), and \(T_ 1\) is an initial segment of T containing every letter occurring in T. The generalized spelling theorem for one-relator groups [see e.g. \textit{P. E. Schupp}, Math. Ann. 221, 73-80 (1976; Zbl 0307.20019)] states that if W is a non-trivial cyclically reduced word in the normal closure of R in the free group, then either W is a cyclic permutation of R or \(R^{-1}\), or contains two disjoint subwords each of which is a Gurevich subword for R. The main result of the present paper generalizes this from free groups to free products of locally indicable groups. Its precise statement and proof are couched in geometrical language in the style of Lyndon's proof of the Freiheitssatz for one-relator groups [see p. 152 of the book Combinatorial Group Theory, by \textit{R. C. Lyndon} and \textit{P. E. Schupp} (1977; Zbl 0368.20023)]. Thus a generalized 1-complex is defined as a connected graph of groups with trivial edge groups (i.e. a connected graph with groups associated with the vertices) in which a path is a (suitable) sequence \(\alpha_ 1,...,\alpha_ n\) where the \(\alpha_ i\) are successive (oriented) edges, or elements of vertex groups. A generalized 2-complex is then such a 1-complex together with certain classes of cyclically reduced loops called 2-cells (each of which one is to imagine (presumably) identified with the boundary of an attached disc, making them contractible). A ''staggered'' generalized 2-complex is defined (with features analogous to those of a staggered presentation as defined in Lyndon's geometric proof mentioned above), and the main result stated in terms of ''Gurevich paths'' in such a complex. The proof is carried out in terms of ''diagrams'' over a generalized 1-complex. Other results are deduced, e.g. the solubility of the ''order problem'': Suppose K is a finite staggered generalized 2-complex in which each 2- cell has a boundary path of period \(>1\), and each vertex group is locally indicable and has soluble word problem; then there is an algorithm for deciding for any loop in K whether or not some power of the loop is contractible, and if so, for computing the least such power. The paper is very clearly written, and the first three sections can in particular be recommended for clarifying one's notions of 2-complexes and diagrams as they pertain to geometric methods in combinatorial group theory.