Enumerating typical abelian coverings of Cayley graphs
Abstract
In this article we complete the work of enumerating typical abelian coverings of Cayley graphs, by reducing the problem to enumerating certain subgroups of finite abelian groups.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.