Stabilization of codimension of persistence barcodes

Justin Allman; Anran Huang

Home/Archive/arXiv

arXiv · 2311.01610

Stabilization of codimension of persistence barcodes

Justin Allman·Anran Huang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver representation and the barcode identifies a distinguished point in an algebraic variety. We prove a formula for the codimension of this variety inside an ambient space of comparable representations which depends only on the combinatorics of the barcode. We therefore extend the notion of codimension to persistence modules over any set $S$ and prove that this extension is well-defined and can be effectively computed via a stabilization property of approximating quiver representations. Further, we prove realization theorems by constructing explicit examples via persistent homology of data for which the codimension can realize any natural number as its value.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Justin Allman, Anran Huang. 2025-03-27. Stabilization of codimension of persistence barcodes. https://arxiv.org/abs/2311.01610

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗

arXiv2026

The Dold-Kan theorem for paracyclic modules

We study the Karoubi operator on the unnormalized chain complex of a paracyclic module; its restriction to the normalized chain complex has previously been considered by Dwyer and Kan, and in the cyclic case by Cuntz and Quillen. We obtain a direct proof of the Dold-Kan theorem for paracyclic modules of Dwyer and Kan, by directly relating the Karoubi operator to projection to the normalized subcomplex.

math.AT↗

arXiv2026

The relative join operad and polyhedral products

An inclusion of nonvoid simplicial complexes induces an arrow of polyhedral products. Applying Ayzenberg's polyhedral join to both complexes gives a symmetric relative join operad. Its endpoint suboperads recover Abramyan--Panov substitution and Ayzenberg composition. Neither endpoint operad nor either relative join operad is finitely generated. The suboperad with nonvoid lower complex arises as the nonempty power-set quotient of the subset-inclusion operad. When tensoring preserves colimits of nonempty finite diagrams, the suboperad acts on arrows by polyhedral colimits up to coherent natural isomorphism. The action induces a set-operad algebra on isomorphism classes of arrows. The dual construction produces Stanley--Reisner quotient arrows, and the colimit action refines Eldridge's loop-space decomposition to arrows. PL ball--boundary pairs form a suboperad of the relative join operad, and minimal interior faces give an operad morphism. Principal pairs have odd-dimensional spherical moment-angle homotopy fibers and yield a closure result for Eldridge's loop-space class.

math.AT↗