Subgroups of Bestvina-Brady groups (Q6924567)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8098574
Language Label Description Also known as
default for all languages
No label defined
    English
    Subgroups of Bestvina-Brady groups
    scientific article; zbMATH DE number 8098574

      Statements

      Subgroups of Bestvina-Brady groups (English)
      0 references
      0 references
      29 September 2025
      0 references
      This paper extends the classical characterization by \textit{C.~Droms} [J. Algebra 110, 519--522 (1987; Zbl 0625.20026)] of right-angled Artin groups (RAAGs) whose subgroups are all RAAGs to the setting of Bestvina-Brady groups. These groups, defined as kernels of length characters \(\chi_{\Gamma}\colon G_\Gamma \to \mathbb{Z}\) on RAAGs, provide important examples in geometric group theory.\N\NThe main result (Theorem 2.8) establishes that for a finite connected graph \(\Gamma\), every subgroup of the Bestvina-Brady group \(B_\Gamma\) is a RAAG if and only if \(\Gamma\) is a tree of Droms graphs, obtained by connected sums of Droms graphs at vertices. Equivalently, \(\Gamma\) must be chordal and exclude two specific induced subgraphs: the gem \(\nabla\) and the overlapping-gems graph \(\overline{H}\).\N\NTheorem 2.8 confirms several Galois-theoretic conjectures for pro-\(p\) Bestvina-Brady groups, showing that \(B_{\Gamma,p} \cong G_K(p)\) for suitable fields \(K\) precisely when \(\Gamma\) is a tree of Droms graphs.
      0 references
      0 references
      Bestvina-Brady group
      0 references
      Lie algebra
      0 references
      cohomology ring
      0 references
      graph theory
      0 references
      Droms graph
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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