Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 18 of the 19 references it cites were found in a registry or an index; 7 of the 12 sources its claims cite were checked for support.

Computing Persistent Homology

Open access
Zomorodian, Afra, Carlsson, Gunnar · 2005 · Discrete & Computational Geometry

Overview

CoChat Summary

TL;DR

The paper shows that persistent homology of a filtered simplicial complex is the standard homology of a graded module over a polynomial ring, yielding a simple interval classification over arbitrary fields. It derives a general persistence algorithm for arbitrary dimensions and fields, and gives a separate algorithm for individual persistent groups over arbitrary PIDs.

Key findings

  • Persistent homology of a filtered \(d\)-dimensional simplicial complex is equivalent to the standard homology of a finitely generated graded module over \(R[t]\), via an equivalence of categories between finite-type persistence modules and finitely generated non-negatively graded \(R[t]\)-modules.
  • Over any field \(F\), persistence modules of finite type are classified bijectively by finite sets of \(P\)-intervals, generalizing the prior interval description from subcomplexes of \(S^3\) over \(\mathbb{Z}_2\) to arbitrary fields and arbitrary dimensions.
  • Over non-fields, no similarly simple classification exists; the paper instead gives an algorithm for computing individual persistent homology groups over an arbitrary PID, with complexity in the order of computing homology groups.
  • Experiments on a Klein bottle show \(\mathbb{Z}_2\)-homology gives \((\beta_0,\beta_1,\beta_2)=(1,2,1)\), while \(\mathbb{Z}_3,\mathbb{Z}_5,\mathbb{Z}_{3203},\) and \(\mathbb{Q}\) give \((1,1,0)\); for dataset J, there are 730,692 \(P\)-intervals in dimension 2, of which 502 are non-empty.

Methods

  • Theoretical development: defines persistence complexes/modules, proves the correspondence to graded modules over \(R[t]\), applies the structure theorem for PIDs, and interprets \(P\)-intervals as lifetimes of homology classes.
  • Algorithm for fields: derives a column-echelon reduction algorithm that computes \(P\)-intervals directly over \(F\), using pivot columns and deleting corresponding rows in the next dimension; worst-case \(O(m^3)\) for \(m\) simplices.
  • Experiments: implements the field algorithm in C with GNU MP for \(\mathbb{Z}_p\) and \(\mathbb{Q}\), and tests on a triangulated Klein bottle \(K\) (12,000 simplices), electrostatic potential dataset \(E\) (529,225 simplices), and supersonic jet flow dataset \(J\) (3,029,383 simplices), using Morse-function excursion filtrations.

Limitations

  • The paper states that over non-fields such as \(\mathbb{Z}\), no simple classification of persistence modules is available or likely ever to be available; only individual persistent groups can be computed over arbitrary PIDs.
  • The field algorithm has \(O(m^3)\) worst-case running time, and the reduction algorithm requires exact integer arithmetic, which is problematic in practice because intermediate matrix entries may become extremely large.
  • For large datasets, the paper states that computing persistence over alternate fields required in excess of 2 GB of memory; for finite fields \(\mathbb{Z}_p\), restricting \(p<2^{16}-1\) is suggested to fit coefficients in 32-bit integers.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1007/s00454-004-1146-y

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

7 Valid · 1 Not valid · 1 Not checked · 58 Own results and interpretations

29 more claims

Create a free account to see all 67 claims and to verify the 2 references still open.

See all claims — free account
  • Probably not a substantial claim. 21
  • It may state two separate claims as one. 16

Create a free account to see these claims.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

1 more claim about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

2 of 2

Citations

Cites

Show all 19 references

Research works printed but not linked: 2

  1. [6]6. Cox, D., Little, J., and O'Shea, D. Ideals , Varieties , and Algorithms , second edn. Springer-Verlag, New York, 1991.
  2. [10]10. Dummit, D., and Foote, R. Abstract Algebra . Wiley, New York, 1999.

Cited by

See all 1,618

Metadata

Authors
Zomorodian, A., & Carlsson, G.
Affiliations
Stanford University (US)
Corresponding author
  • Zomorodian, Afra
  • Carlsson, Gunnar
Venue
Discrete & Computational Geometry
Published
2004-11-19
Volume
33
Issue
2
Pages
249-274
ISSN
  • 0179-5376 (ISSN-L)
  • 1432-0444
OpenAlex
W2144044408
Cited by
1,591
References
19
Citations by year
2026: 89 · 2025: 114 · 2024: 106 · 2023: 116 · 2022: 122 · 2021: 173 · 2020: 134 · 2019: 141 · 2018: 103 · 2017: 62 · 2016: 76 · 2015: 51 · 2014: 55 · 2013: 42 · 2012: 45
FWCI
10.87
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
Discrete & Computational Geometry (publishedVersion)
Funders
  • National Science Foundation (0138456, 0086013, 0101364)
  • University of Chicago
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
  • Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
Keywords
persistent homology, simplicial complexes, filtered simplicial complexes, graded modules, polynomial rings, homology computation, principal ideal domains, computational topology

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Computing Persistent Homology. https://app.cochat.ai/papers/10.1007/s00454-004-1146-y
The paper
Zomorodian, A., & Carlsson, G. (2005). Computing Persistent Homology. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-004-1146-y

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.