Lifting automorphisms along abelian regular coverings of graphs
Haimiao Chen

TL;DR
This paper presents a criterion for determining when automorphisms of a graph can be lifted along abelian regular coverings, aiding in understanding symmetries in graph coverings with finite abelian groups.
Contribution
It introduces an effective criterion for lifting automorphisms along regular graph coverings with finite abelian groups, advancing the theory of graph symmetries.
Findings
Provides a practical method for lifting automorphisms
Applicable to coverings with any finite abelian group
Enhances understanding of graph symmetry structures
Abstract
This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.
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 · Coding theory and cryptography · Geometric and Algebraic Topology
