Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lifting Voltages in Graph Covers

Published 28 Jan 2025 in math.CO | (2501.17135v1)

Abstract: We consider voltage digraphs, here referred to as graphs, whose edges are labeled with elements from a given group, and explore their derived graphs. Given two voltage graphs, with voltages in abelian groups, we establish a necessary and sufficient condition for their two derived graphs to be isomorphic. This condition requires: (1) the existence of a voltage graph that covers both given graphs, and (2) when the two sets of voltages are lifted to the common cover, the correspondence between these sets of voltages determines an isomorphism between the groups generated by these voltages. We show that conditions (1) and (2) are decidable, and provide a method for constructing the common cover and for lifting the voltage assignments.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

Continue Learning

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