betaFeedback

WorksMathematics

Complete characterization of graphs with common maximal abelian cover

Abstract

The maximal abelian cover of a connected graph is the quotient of its universal cover by the commutator subgroup of its fundamental group. We provide a complete classification of finite connected graphs with isomorphic maximal abelian covers. For trees or for connected graphs with at least two cycles, the cover determines the base up to isomorphism; in cycle rank one, it determines the primitive cyclic pattern of rooted trees attached to the unique cycle. We also characterize when every automorphism descends to the base and give an orbit-size criterion for splitting the canonical lift extension, answering two questions raised by Baez in 2026.

Paper details

vlnc:W_jn6tm4sz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-6

View statement
Looking for related papers…