SearcharxivSearch

arXiv · 2510.13038

Pure symmetric automorphisms, extensions of RAAGs, and Koszulness

Abstract

We characterize in terms of a combinatorial condition on the graph $\Gamma$ when the group $\mathrm{PAut}(A_\Gamma)$ of pure symmetric automorphisms of the RAAG $A_\Gamma$ and its outer version $\mathrm{POut}(A_\Gamma)$ have a descending central Lie algebra which is Koszul. To do that, we prove that our combinatorial condition implies that these groups are iterated extensions of RAAGs; in particular, they are poly-free. On the other hand, we show that $\mathrm{PAut}(F_n)$ is not poly-finitely generated free for $n \geq 4$. We also show that groups in a certain class containing $\mathrm{PAut}(A_\Gamma)$ are 1-formal.

Explore related subjects

Keep this discovery

BibTeXRIS

Conchita Martínez-Pérez, Luis Mendonça. 2025-10-14. Pure symmetric automorphisms, extensions of RAAGs, and Koszulness. https://arxiv.org/abs/2510.13038

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