SearcharxivSearch

arXiv · 1804.02874

New zeta functions of Reidemeister type and twisted Burnside-Frobenius theory

Abstract

We introduce new zeta functions related to an endomorphism $\phi$ of a discrete group $\Gamma$. They are of two types: counting numbers of fixed ($\rho\sim \rho\circ\phi^n$) irreducible representations for iterations of $\phi$ from an appropriate dual space of $\Gamma$ and counting Reidemeister numbers $R(\phi^n)$ of different compactifications. Many properties of these functions and their coefficients are obtained. In many cases it is proved that these zeta functions coincide. The Gauss congruences are proved. Useful asymptotic formulas for the zeta functions are found. Rationality is proved for some examples, which give also the first counterexamples simultaneously for TBFT ($R(\phi)$=the number of fixed irreducible unitary representations) and TBFT$_f$ ($R(\phi)$=the number of fixed irreducible unitary finite-dimensional representations) for an automorphism $\phi$ with $R(\phi)<\infty$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Fel'shtyn, Evgenij Troitsky, Malwina Ziętek. 2018-04-09. New zeta functions of Reidemeister type and twisted Burnside-Frobenius theory. https://arxiv.org/abs/1804.02874

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