Parafree graphs of groups with cyclic edge groups (Q6561008)

From MaRDI portal





scientific article; zbMATH DE number 7870409
Language Label Description Also known as
default for all languages
No label defined
    English
    Parafree graphs of groups with cyclic edge groups
    scientific article; zbMATH DE number 7870409

      Statements

      Parafree graphs of groups with cyclic edge groups (English)
      0 references
      0 references
      0 references
      24 June 2024
      0 references
      Let \(G\) be a group. If \(G\) is residually nilpotent and its quotients by the terms of the lower central series are the same as those of a free group then following \textit{G. Baumslang} [Trans. Am. Math. Soc. 129, 308--321 (1967; Zbl 0153.35002)], \(G\) is said to be parafree.\N\NIn this paper, the authors determine when the fundamental group of a finite graph of groups with cyclic edge groups is parafree. In particular, they prove (Theorem 1.1) that if \(U\) and \(V\) are finitely generated parafree groups, \(1 \not = u \in U\), \(1 \not = v \in V\), then the amalgamated free product \(W=U \underset{u=v} \ast V\) is parafree if and only if (a) The element \(uv^{-1}\) is not a proper power in the abelianization of the free product \(U \ast V\) and (b) at least one of \(u\) or \(v\) is not a proper power in \(U\) or \(V\), respectively.\N\NA particular case of Theorem 1.1, where \(U\) and \(V\) are free, follows from results of \textit{G. Baumslag} [Commun. Pure Appl. Math. 21, 491--506 (1968; Zbl 0186.32101)] and \textit{D. N. Azarov} [Math. Notes 64, No. 1, 3--7 (1998; Zbl 0922.20030)].\N\NThe authors also discuss the case of HNN-extensions with cyclic base groups, but the result (see Theorem 1.2) is more intricate.
      0 references
      0 references
      parafree group
      0 references
      residual nilpotent group
      0 references
      free product with amalgamation
      0 references
      HNN-extension
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references