Topological Crystals
Abstract
Sunada's work on crystallography emphasizes the role of the "maximal abelian cover" of a graph . This is a covering space of for which the group of deck transformations is the first homology group . An embedding of the maximal abelian cover in a vector space can serve as the pattern for a crystal: atoms are located at the vertices, while bonds lie along the edges. We prove that for any connected graph without bridges, there is a canonical embedding of the maximal abelian cover of into the vector space , called a "topological crystal". Crystals of graphene and diamond are examples of this construction. We prove that any symmetry of a graph lifts to a symmetry of its topological crystal. We also compute the density of atoms in a topological crystal. The key technical tools are a way of decomposing the 1-chain coming from a path in into manageable pieces, and the work of Bacher, de la Harpe and Nagnibeda on integral cycles and integral cuts.
Cite
@article{arxiv.1607.07748,
title = {Topological Crystals},
author = {John C. Baez},
journal= {arXiv preprint arXiv:1607.07748},
year = {2026}
}
Comments
Improved discussion of earlier work, 20 pages LaTeX with .png figures