Galois coverings of Schreier graphs of groups generated by bounded automata
Asif Shaikh, Daniele D'Angeli, Hemant Bhate, Dilip Sheth
TL;DR
The paper addresses coverings of Schreier graphs arising from groups generated by bounded automata, providing a precise criterion for when the levelwise coverings $\Gamma_{n+1}\to\Gamma_n$ are Galois. It introduces a generalized replacement product to model $\Gamma_{n+r}$ as a combinatorial product $\Gamma_n \textcircled{g} \Gamma_r$ and proves that such constructions yield unramified (and cyclic, under a root-permutation condition) coverings. The authors develop an Artin-L-functions framework for these Galois covers, giving determinant formulas and a product decomposition for Ihara zeta functions, with explicit computations in examples like Grigorchuk, Gupta–Sidki, Fabrykowski–Gupta, Basilica, and BSV. The work also discusses non-bounded automaton groups and poses an open question about the extent to which the bounded-case cyclic-covering phenomenon extends to non-bounded settings.
Abstract
We give a characterization of the covering Schreier graphs of groups generated by bounded automata to be Galois. We also investigate the zeta and L functions of Schreier graphs of few groups namely the Grigorchuk group, Gupta-Sidki p group, Gupta-Fabrykowski group and BSV torsion-free group.
