Papers
Topics
Authors
Recent
Search
2000 character limit reached

Galois coverings of Schreier graphs of groups generated by bounded automata

Published 9 Nov 2017 in math.CO | (1711.03432v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.