Enumerating typical abelian coverings of Cayley graphs
Haimiao Chen

TL;DR
This paper completes the enumeration of typical abelian coverings of Cayley graphs by reducing the problem to counting specific subgroups within finite abelian groups.
Contribution
It introduces a reduction method that simplifies the enumeration of abelian coverings of Cayley graphs to subgroup enumeration in finite abelian groups.
Findings
Complete enumeration of typical abelian coverings achieved.
Reduction of the problem to subgroup enumeration in finite abelian groups.
Provides a framework for further enumeration and classification.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Graph theory and applications
