SearcharxivSearch

arXiv · 2102.10900

P\'olya-Carlson dichotomy for coincidence Reidemeister zeta functions via profinite completions

Abstract

We consider coincidence Reidemeister zeta functions for tame endomorphism pairs of nilpotent groups of finite rank, shedding new light on the subject by means of profinite completion techniques. In particular, we provide a closed formula for coincidence Reidemeister numbers for iterations of endomorphism pairs of torsion-free nilpotent groups of finite rank, based on a weak commutativity condition, which derives from simultaneous triangularisability on abelian sections. Furthermore, we present results in support of a P\'olya-Carlson dichotomy between rationality and a natural boundary for the analytic behaviour of the zeta functions in question.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Fel'shtyn, Benjamin Klopsch. 2021-02-22. P\'olya-Carlson dichotomy for coincidence Reidemeister zeta functions via profinite completions. https://arxiv.org/abs/2102.10900

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