2000 character limit reached
Galois coverings of Schreier graphs of groups generated by bounded automata (1711.03432v1)
Published 9 Nov 2017 in math.CO
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.