SearcharxivSearch

arXiv · 1410.4326

Zeta functions of finite groups by enumerating subgroups

Abstract

For a finite group $G$, we consider the zeta function $\zeta_G(s) = \sum_{H} \abs{H}^{-s}$, where $H$ runs over the subgroups of $G$. First we give simple examples of abelian $p$-group $G$ and non-abelian $p$-group $G'$ of order $p^m, \; m \geq 3$ for odd $p$ (resp. $2^m, \; m \geq 4$) for which $\zeta_G(s) = \zeta_{G'}(s)$. Hence we see there are many non-abelian groups whose zeta functions have symmetry and Euler product, like the case of abelian groups. On the other hand, we show that $\zeta_G(s)$ determines the isomorphism class of $G$ within abelian groups, by estimating the number of subgroups of abelian $p$-groups. Finally we study the problem which abelian $p$-group is associated with a non-abelian group having the same zeta function.

Explore related subjects

Keep this discovery

BibTeXRIS

Yumiko Hironaka. 2014-10-16. Zeta functions of finite groups by enumerating subgroups. https://arxiv.org/abs/1410.4326

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