SearcharxivSearch

arXiv · 2605.23003

Symplectic lattice counting and zeta functions of higher Heisenberg groups

Abstract

We derive explicit formulae for the subalgebra zeta functions of all higher Heisenberg Lie algebras over an arbitrary compact discrete valuation ring $\mathfrak{o}$. To this end, we develop Hecke-theoretic techniques for the enumeration, by two distinct invariants, of sublattices of an $\mathfrak{o}$-lattice of finite rank endowed with a non-degenerate symplectic form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianhao Shen, Christopher Voll. 2026-05-21. Symplectic lattice counting and zeta functions of higher Heisenberg groups. https://arxiv.org/abs/2605.23003

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