Persistent Local Systems of Periodic Spaces
Adam Onus, Primoz Skraba
TL;DR
This work develops a robust, computable framework for recovering the persistent homology of spatially periodic spaces from finite quotient data. By leveraging cellular bisheaves, epification/monofication, and the resulting persistent local systems, the authors classify toroidal cycles and connect them to the ambient periodic topology through a principled lifting to the covering space. They prove embedding theorems for 1- and d-periodic cases, showing that the relevant toroidal information embeds into a canonical PLS and can be accessed via monodromy matrices, enabling polynomial-time computation of the canonical PLS. The proposed algorithms for constructing bisheaves and performing isobisheafification render the theory computationally viable and scalable, with explicit procedures for extracting toroidal-cycle data from real data. Overall, the paper provides a complete, practical persistence-theoretic treatment of periodic spaces, bridging covering-space theory, monodromy, and scalable TDA for applications in materials science, cosmology, and beyond.
Abstract
The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice, these objects are studied by taking a finite sample and introducing periodic boundary conditions, however this introduces and removes many subtle homological features. Here, build on the work of Onus and Robins (2022) and Onus and Skraba (2023) to investigate whether one can recover the (persistent) homology of a periodic cell complex $K$ from a finite quotient space $G$ of equivalence classes under translations. In particular, we search for a computationally friendly method to identify all ''toroidal cycles'' of $G$ which do not lift to cycles in $K$. We show that all toroidal and non-toroidal cycles of $G$ of arbitrary homology degree can be completely classified for $K$ of arbitrary periodicity using the recently developed machinery of bisheaves and persistent local systems. In doing so, we also introduce a framework for a computationally viable persistence theory of periodic spaces. Finally, we outline algorithms for how to apply our results to real data, including a polynomial time algorithm for calculating the canonical persistent local system attributed to a given bisheaf.
