SearcharxivSearch

arXiv · 1711.03849

Univariate and bivariate zeta functions of unipotent group schemes of type $G$

Abstract

We compute the representation and class counting zeta functions for a family of torsion-free finitely generated nilpotent groups of nilpotency class $2$. These groups arise from a generalisation of one the families of unipotent groups schemes treated by Stasinski and Voll, and Lins. The univariate zeta functions are obtained by specialising the respective bivariate zeta functions defined by Lins. These are also used to deduce a formula for a joint distribution on Weyl groups of type $B$.

Explore related subjects

Keep this discovery

BibTeXRIS

Michele Zordan. 2017-11-10. Univariate and bivariate zeta functions of unipotent group schemes of type $G$. https://doi.org/10.1142/s0218196722500291

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