Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.02717

Enumerating traceless matrices over compact discrete valuation rings

Angela Carnevale·Shai Shechter·Christopher Voll
View original source ↗Read source document ↗Export metadata ↓

Abstract

We enumerate traceless square matrices over finite quotients of compact discrete valuation rings by their image sizes. We express the associated rational generating functions in terms of statistics on symmetric and hyperoctahedral groups, viz. Coxeter groups of types A and B, respectively. These rational functions may also be interpreted as local representation zeta functions associated to the members of an infinite family of finitely generated class-2-nilpotent groups. As a byproduct of our work, we obtain descriptions of the numbers of traceless square matrices over a finite field of fixed rank in terms of statistics on the hyperoctahedral groups.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Angela Carnevale, Shai Shechter, Christopher Voll. 2017-09-08. Enumerating traceless matrices over compact discrete valuation rings. https://arxiv.org/abs/1709.02717

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↗