On accessibility for pro-\(p\) groups (Q1730184)

A discrete group \(G\) is said to be accessible if there is an integer \(n\) such that any finite reduced graph of discrete groups with finite edge groups having fundamental group isomorphic to \(G\) has at most \(n\) edges. This definition is equivalent to the original one by \textit{C.T.C. Wall} [J. Pure Appl. Algebra 1, 141--154 (1971; Zbl 0218.18011)] and encodes the idea that one cannot keep splitting \(G\) over finite subgroups. \textit{M. J. Dunwoody} has shown that finitely generated groups are not in general accessible [Lond. Math. Soc. Lect. Note Ser. 181, 75--78 (1993; Zbl 0833.20035)], but finitely presented groups are [Invent. Math. 81, 449--457 (1985; Zbl 0572.20025)]. In the paper under review, the author begins a study of accessibility for pro-\(p\) groups. The main result is the construction of an inaccessible, finitely generated pro-\(p\) group. As a consequence, an example is obtained of an inaccessible discrete group which is finitely generated and residually \(p\)-finite. A key result (Theorem 3.1) states that if \(G\) is a finitely generated pro-\(p\) group, and the edge groups of a proper reduced finite graph of group decompositions of \(G\) have orders uniformly bounded by the integer \(K\), then the graph has at most \[ \frac{p K}{p - 1} \, (d(G) - 1) + 1 \] edges, where \(d(G)\) is the minimum number of generators of \(G\) as a pro-\(p\) group. It remains an open problem whether all finitely presented pro-\(p\) groups are accessible.