SearcharxivSearch

arXiv · 1508.00371

Zeta functions of finite Schreier graphs and their zig zag products

Abstract

We investigate the Ihara zeta functions of finite Schreier graphs $\Gamma_n$ of the Basilica group. We show that $\Gamma_{1+n}$ is $2$ sheeted unramified normal covering of $\Gamma_n, ~\forall~ n \geq 1$ with Galois group $\displaystyle \frac{\mathbb{Z}}{2\mathbb{Z}}.$ In fact, for any $n > 1, r \geq 1$ the graph $\Gamma_{n+r}$ is $2^n$ sheeted unramified, non normal covering of $\Gamma_r.$ In order to do this we give the definition of the $generalized$ $replacement$ $product$ of Schreier graphs. We also show the corresponding results in zig zag product of Schreier graphs $\Gamma_n$ with a $4$ cycle.

Explore related subjects

Keep this discovery

BibTeXRIS

Asif Shaikh, Hemant Bhate. 2015-08-03. Zeta functions of finite Schreier graphs and their zig zag products. https://arxiv.org/abs/1508.00371

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