SearcharxivSearch

arXiv · 2608.23702

Nilpotent groups with Dehn function $n^2 \log n$

Abstract

We exhibit 2-step Carnot groups with Dehn function $n^2 \log n$, sharpening Wenger's superquadratic lower bound for these groups. Some of these groups admit lattices, yielding finitely generated nilpotent groups with Dehn function $n^2 \log n$. This gives the first exact computation of a Dehn function which does not grow like $n^\alpha$ for any $\alpha \geq 1$ among nilpotent groups and, more generally, among finitely presented solvable groups with subexponential Dehn function.

Explore related subjects

Keep this discovery

BibTeXRIS

Ken Vandermeersch. 2026-08-24. Nilpotent groups with Dehn function $n^2 \log n$. https://arxiv.org/abs/2608.23702

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