SearcharxivSearch

arXiv · 2205.09154

On the structure of finitely presented Bestvina-Brady groups

Abstract

Right-angled Artin groups and their subgroups are of great interest because of their geometric, combinatorial and algorithmic properties. It is convenient to define these groups using finite simplicial graphs. The isomorphism type of the group is uniquely determined by the graph. Moreover, many structural properties of right angled Artin groups can be expressed in terms of their defining graph. In this article we address the question of understanding the structure of a class of subgroups of right-angled Artin groups in terms of the graph. Bestvina and Brady, in their seminal work, studied these subgroups (now called Bestvina-Brady groups or Artin kernels) from a finiteness conditions viewpoint. Unlike the right-angled Artin groups the isomorphism type of Bestvina-Brady groups is not uniquely determined by the defining graph. We prove that certain finitely presented Bestvina-Brady groups can be expressed as an iterated amalgamated product. Moreover, we show that this amalgamated product can be read off from the graph defining the ambient right-angled Artin group.

Explore related subjects

Keep this discovery

BibTeXRIS

Priyavrat Deshpande, Mallika Roy. 2022-05-18. On the structure of finitely presented Bestvina-Brady groups. https://arxiv.org/abs/2205.09154

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR