Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1707.02481

Trees, homology, and automorphism groups of RAAGs

Javier Aramayona·José L. Fernández·Pablo Fernández·Conchita Martínez-Pérez
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this subgroup, based on the number and degree of a certain type of vertices, which we call deep. We then use combinatorial methods to analyze the average value of this Betti number, in terms of the size of the defining tree.

Explore related subjects

math.GRmath.COmath.PR

Keep this discovery

BibTeXRIS

Javier Aramayona, José L. Fernández, Pablo Fernández, Conchita Martínez-Pérez. 2017-07-08. Trees, homology, and automorphism groups of RAAGs. https://doi.org/10.1007/s10801-018-0854-y

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗