Pith. sign in

REVIEW 2 major objections 4 minor 50 references

The fiber of multiparameter persistent homology for simplicial complexes

T0 review · 2 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read For a fixed finite simplicial complex, the set of n-filter functions with a given multiparameter persistent homology is a polyhedral complex and its dimension is bounded by Betti-table data.

desk verdict First real description of the fibers of multiparameter persistent homology; the load-bearing stratification proof is sound, and the stress-test's main objection is a misquote that evaporates on reading. read the letter →

arxiv 2608.04640 v1 pith:FXCW2SFS submitted 2026-08-05 math.AT

Heather A. Harrington , Ulrike Tillmann , Maria Torras-Pérez This is my paper · ORCID
classification math.AT MSC 55N3155R10
keywords multiparameterpersistenthomologyinverseproblemfiberbundlestratificationminimalgridBettitablesinterleavingdistancesimplicialcomplexes
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies how much information is lost when a vector-valued filter on a fixed finite simplicial complex is compressed to its multiparameter persistent homology (MPH). The authors' main claim is that for any homology class realized by some n-filter, the entire set of n-filters producing that class is not wild: it is a finite polyhedral complex, and over each natural stratum of the moduli space the preimage forms a trivial fiber bundle. They further prove that the dimension of any such fiber is bounded above by (n/2)(|K| − L(M)), where |K| is the number of simplices and L(M) is a non-negative integer computed from the module's Betti tables. This recovers the known one-parameter fiber bound as a special case, giving a quantitative answer to the inverse problem for multiparameter persistent homology.

What carries the argument

The central object is the minimal grid of an essentially finite persistence module: the unique smallest finite product of ordered coordinate sets from which the module can be reconstructed. The action of Aut0(I^n,≤) ≅ Epi(I,≤)^n, the closure of the identity component of order-isomorphisms of the cube, moves minimal grids without crossing points, and each orbit is homeomorphic to a product of open simplices recording the interior grid positions. Key Lemma 1.26, asserting that grids of modules closer than half the granularity are epsilon-close coordinatewise, makes the orbit parametrisation continuous and lets the authors show MPH is strongly stratified. Over a stratum, MPH becomes a projection onto the sub-coordinates of the filter values that lie in the minimal grid, which is exactly why the fiber is a polyhedral complex; the dimension bound comes from combining homological Morse numbers with Betti-table inequalities.

What would settle it

Build two essentially finite n-parameter modules M,N with d_I(M,N) < ℓ_M/2, where ℓ_M is the smallest gap between distinct coordinates of M's minimal grid, such that some coordinate of M's minimal grid is farther than d_I(M,N) from every coordinate of N's minimal grid; such a pair would falsify Key Lemma 1.26 and with it the orbit parametrisation, the strong stratification, and the polyhedral fiber description.

Watch

Extended reading notes

Core claim

The central discovery is a structural description of the fiber of the multiparameter persistent homology map MPH: Filt^n_K -> $M_n^{{dim K+1}}$, stated as Theorem 5.3 and Proposition 5.9. MPH is equivariant under the natural action of order-isomorphisms of the unit n-cube, and both the space of filters and the image of MPH admit stratifications whose strata are these orbits. On each stratum of the image, MPH restricts to a trivial fiber bundle whose fiber is the support of a polyhedral complex; individually, the intersection of the fiber with the closure of any filter stratum is a polyhedron affinely isomorphic to a product of simplices. The dimension of the whole fiber is at most (n/2)(|K| − L(M)), where L(M) sums lower bounds b^q(g) on homological Morse numbers over the minimal grid G, recovering the one-parameter bound of Leygonie and Tillmann. The proof rests on a minimal-grid construction: every essentially finite module has a unique smallest finite grid recording its essential grades, and Key Lemma 1.26 shows this grid persists under small interleavings.

Load-bearing premise

The argument stands on Key Lemma 1.26, which claims that if one module is closer than half the smallest grid gap of another, then the second module's minimal grid must contain a point near each grid point of the first; if that lemma fails, the orbit descriptions of the fibers collapse.

Editorial extensions

If this is right

  • Every fiber MPH^{-1}([M]) is a finite union of polyhedra, so the inverse problem for MPH has a finite, piecewise-linear description rather than an arbitrary topological one.
  • For a fixed module stratum, the polyhedral structure of the fiber is constant: any two modules in the same stratum have homeomorphic, indeed affinely isomorphic, fibers.
  • If an n-filter is injective in every coordinate, its fiber is 0-dimensional, meaning that only finitely many injective filters realize the same multiparameter persistent homology.
  • In the one-parameter case n=1, the new bound reduces to the known Leygonie-Tillmann bound, so the result is a genuine generalization rather than an unrelated estimate.
  • For the small example of 2-filters on the 1-simplex, the bound is sharp at every module stratum, so at least in that case the estimate is not wasteful.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step, not treated in the paper, is to turn the polyhedral-cell description into an algorithm that enumerates or samples all n-filters realizing a given module, along the lines of existing reconstruction algorithms for one-parameter persistence.
  • Because the dimension bound depends only on Betti tables, it could be computed from module data alone and may help identify modules whose fibers are forced to be large, though the paper leaves sharpness for general complexes open.
  • Repeating the 1-simplex calculation on a 2-simplex or on a complex with a nontrivial cycle would test whether the bound remains sharp beyond the single worked example, an extension the authors do not carry out.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper studies the inverse problem for multiparameter persistent homology (MPH) of n-filters on a fixed finite simplicial complex K. It introduces the moduli space of essentially finite n-parameter persistence modules with grids in the unit cube, defines minimal grids and their granularity, and proves a Key Lemma relating interleaving distance to minimal grids. The authors then define actions of order-preserving reparametrizations of the cube on the space of filters and on the moduli space, prove equivariance of MPH, and use orbit decompositions to stratify both domain and codomain. The main results are that MPH is strongly stratified, that each fiber over a module stratum is the support of a polyhedral complex, that MPH restricted to a stratum is a trivial fiber bundle, and that the fiber dimension is bounded by (n/2)(|K| - L(M)), where L(M) is a nonnegative integer computed from Betti tables. In the one-parameter case this recovers the Leygonie–Tillmann bound. A detailed example for 2-filters on the 1-simplex is provided.

Significance. If the identified gaps are repaired, this is a substantial contribution. It appears to be the first systematic study of fibers of multiparameter persistent homology for simplicial complexes, and it provides concrete geometric structure: fibers are polyhedral complexes, and the dimension bound is stated in terms of computable algebraic invariants. The paper contains detailed proofs, a clear organization, and an explicit example illustrating the strata and fibers. The recovery of the one-parameter Leygonie–Tillmann result is a useful consistency check. The main technical innovation, the minimal grid and its continuity properties, is natural and likely to be of independent interest.

major comments (2)
  1. [§4.2, Proposition 4.16] The closedness proof of the sets X_i uses Key Lemma 1.26 with the un-extended granularity ℓ_M and asserts that for any [N] with d_I(M,N)≤ϵ<ℓ_M/2, the minimal grid of N contains at least as many interior points in each coordinate as the minimal grid of M. This implication is false as stated. Key Lemma 1.26(i) only guarantees that for each x∈G_j there is some y∈H_j with |x−y|≤ϵ, and y need not be an interior point. For example, let K be a single vertex, n=1, M=[0.01,∞), and N=[0,∞). Then G={0.01}, H={0}, ℓ_M=∞, and d_I(M,N)=0.01<ℓ_M/2, yet κ_1(N)=0 while κ_1(M)=1. Thus the claimed inequality odim(N)≥odim(M) fails, and the ball of radius ℓ_M/2 contains modules of strictly smaller orbit dimension. The argument can be repaired by using the extended granularity ℓ̄_M from Definition 3.21: for ϵ<ℓ̄_M/2, a point within ϵ of an interior grid point cannot be a boundary point, and distinct interior grid points cannot be matched to the same point. Because this closedness statement is part of the stratification Proposition 4.16 and underpins Theorems 4.18 and 5.3, the current proof has a load-bearing gap that must be fixed.
  2. [§5.2, Proposition 5.9] The dimension bound relies on Theorem 5.6 imported from Guidolin and Landi [30] without stating its hypotheses or verifying that they hold for the essentially finite modules over arbitrary fields considered here. The text says only that 'Their results translate directly to essentially finite modules,' but no translation argument or precise hypothesis check is given. Since Proposition 5.9 is one of the central claims, the authors should either quote a version of [30, Theorems 7.3 and 7.5] that explicitly covers real-exponent, essentially finite modules over an arbitrary field, or add a lemma verifying the hypotheses. As written, the advertised generality of the dimension bound is not checkable from the manuscript.
minor comments (4)
  1. [§3.1–§3.5] The notation Aut0(I^n,≤) is used for both the connected component of the order isomorphism group and its closure in End(I^n,≤). Please introduce and use an overline consistently, e.g. \overline{Aut_0(I^n,≤)}, to distinguish the closure from the group itself.
  2. [Definition 3.21] The extended grid is denoted by the same symbol G as the minimal grid in the running text. Use \bar{G} or a similar notation consistently to avoid confusion.
  3. [Lemma 3.22] In the proof, the sentence comparing grids should be coordinate-wise: '|G_j∩(0,1)|=|H_j∩(0,1)| for all j', rather than the set-level statement 'G∩(0,1) and H∩(0,1) are at distance at most ϵ' without specifying the coordinate projection.
  4. [§1.3, Key Lemma 1.26] The proof of Key Lemma 1.26 is long and dense. Given its central role in the stratification and fiber results, a more modular presentation or a structured verification of the floor equalities in the diagram would improve readability and checkability.

Circularity Check

0 steps flagged · score 1.0 of 10

No circularity: the central derivation is self-contained; the only self-citation is to a published one-parameter benchmark used as a proof template, not as an input premise.

full rationale

The main results are derived from internally developed ingredients: Key Lemma 1.26 (with a full proof included), the action of Aut0(I^n,≤) on filters and modules, the orbit parametrizations of Propositions 4.7 and 4.12, and the projection description of MPH on filter strata. The stratification theorems and the polyhedral fiber description are proved from these ingredients rather than imported from prior work. No parameter is fitted to data, no post-hoc quantity is renamed as a prediction, and no 'uniqueness theorem' by the authors is invoked to force a choice. The only self-citation with any technical weight is [40] (Leygonie and Tillmann, containing the second author), which is used in two ways: as the one-parameter bound to be recovered ('recovering as a special case the known one-parameter bound obtained by Leygonie and Tillmann in 2022 [40]') and as a proof template ('This proof follows the structure of the proof of the bound for n=1 in Proposition 2.5 of [40]' and 'assertion (b) follows by the same argument as in the single-parameter case n=1. For the details, see the proof of Theorem 2.2(b) in [40]'). These are citations to a published, independently checkable proof, not to an unverified premise; the multiparameter bound still requires the new inequalities (25) and (26) and the external Guidolin–Landi theorem [30]. The flagged concern about Proposition 4.16 is a proof-detail / correctness issue, not circularity: the manuscript explicitly uses the extended granularity bar-ell_M in that sentence ('d_I(M,N) ≤ ϵ < bar-ell_M / 2'), and even a genuine gap there would not make the derivation reduce to its own inputs. Accordingly, the paper has, at most, one minor self-citation that is not load-bearing, and the central claims have independent mathematical content.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No parameters are fitted and no new entities are postulated. The paper's contribution is a derivation from standard persistence-module theory, and its main external input is the published Morse-inequality theorem of Guidolin and Landi.

assumptions (4)
  • standard math n-parameter persistence modules are equivalent to n-graded modules over a polynomial ring, and minimal free resolutions have length at most n (Hilbert syzygy theorem).
    Used throughout Section 1.4 to define and compute Betti tables, and in the proof of Lemma 5.10.
  • domain assumption The interleaving distance is stable for sublevel set filtrations of n-filters.
    Quoted as Theorem 2.11 from Lesnick [35]; used to show MPH is Lipschitz and to justify the metric topology on M_n.
  • domain assumption Essentially finite modules are finitely presentable, and the minimal grid is the smallest grid containing the grades of generators and relations in a minimal presentation.
    Adapted from Lesnick and Wright [37] as Lemmas 1.22 and 1.23; needed for the link between grids and Betti tables.
  • domain assumption Guidolin and Landi's Morse inequalities for homological Morse numbers in terms of multigraded Betti numbers hold for essentially finite modules with real-exponent grids.
    Imported as Theorem 5.6 from [30] without proof; this is the key external input for the dimension bound in Proposition 5.9.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The fiber of multiparameter persistent homology for simplicial complexes." pith.science (2026). https://pith.science/paper/FXCW2SFS

@misc{pith2026260804640,
  author       = {Pith},
  title        = {Pith review of: The fiber of multiparameter persistent homology for simplicial complexes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FXCW2SFS}},
  note         = {Machine review of arXiv:2608.04640}
}
abstract

Vector-valued functions on finite simplicial complexes give rise to multiparameter sublevel set filtrations and corresponding persistent homology. We study the associated inverse problem for multiparameter persistent homology (MPH) of $n$-filters on a fixed finite simplicial complex. We endow both the space of filters and the moduli space of essentially finite persistence modules with stratifications, where strata are given by orbits of natural actions of order-isomorphisms of the unit $n$-cube. The MPH map is then shown to be equivariant and strongly stratified. Over each stratum in the image, the MPH map restricts to a trivial fiber bundle whose fiber is a polyhedral complex. We provide an upper bound on the dimension of the fibers in terms of multigraded Betti numbers, recovering as a special case the known one-parameter bound obtained by Leygonie and Tillmann (2022).

Figures

Figures reproduced from arXiv: 2608.04640 by the authors.

Figure 1
Figure 1. Example of a 2-filter on the triangle and [PITH_FULL_IMAGE:figures/full_fig_p020_1.png] view at source ↗
Figure 2
Figure 2. Examples of filters in each of the four top-dimensional strata of Filt [PITH_FULL_IMAGE:figures/full_fig_p045_2.png] view at source ↗
Figure 3
Figure 3. Representation of Filt2 K as a union of 4 products ∆3 × ∆3 with face identifications. Here, the pair of red points uniquely identifies a filter. The map MP H computes connected components and how they merge in the filtration. Since it is invariant under symmetries of K, in the image MK 2 the 6-strata (a) and (d) in [PITH_FULL_IMAGE:figures/full_fig_p045_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Representation of the fiber of a module with a single generator at grade [PITH_FULL_IMAGE:figures/full_fig_p046_4.png]
Figure 5
Figure 5. Figure 5: Representation of the strata in MK2 for Example 6.1. 47 [PITH_FULL_IMAGE:figures/full_fig_p047_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

50 extracted references · 41 canonical work pages

  1. [30]

    ‘Morse inequalities for the Koszul complex of multi-persistence’

    Andrea Guidolin and Claudia Landi. ‘Morse inequalities for the Koszul complex of multi-persistence’. In:Journal of Pure and Applied Algebra227.7 (July 2023), p. 107319.issn: 0022-4049.doi: https://doi.org/10.1016/j.jpaa.2023.107319.url:https://www.sciencedirect.com/ science/article/pii/S0022404923000026

    work page arXiv 2023

  2. [1]

    Botnan, Steffen Oppermann and Johan Steen

    Ulrich Bauer, Magnus B. Botnan, Steffen Oppermann and Johan Steen. ‘On the additive im- age of zeroth persistent homology’. In:Transactions of the London Mathematical Society13.1 (2026), e70027.doi:https://doi.org/10.1112/tlm3.70027. eprint:https://londmathsoc. onlinelibrary.wiley.com/doi/pdf/10.1112/tlm3.70027.url:https://londmathsoc. onlinelibrary.wiley...

    work page doi:10.1112/tlm3.70027 2026

  3. [2]

    Ulrich Bauer, Thomas Br¨ ustle and Luis Scoccola.An Algebraic Introduction to Persistence. 2026. doi:10.48550/ARXIV.2604.07022.url:https://arxiv.org/abs/2604.07022

    work page Pith review arXiv doi:10.48550/arxiv.2604.07022 2026

  4. [3]

    2026.doi:10.48550/ARXIV.2603.12049.url:https: //arxiv.org/abs/2603.12049

    Ulrich Bauer, Cameron Gusel and Luis Scoccola.A metrically complete and Krull–Schmidt space of multiparameter persistence modules. 2026.doi:10.48550/ARXIV.2603.12049.url:https: //arxiv.org/abs/2603.12049

    work page doi:10.48550/arxiv.2603.12049 2026

  5. [4]

    ‘Multi-parameter Persistence Modules are Generically Indecom- posable’

    Ulrich Bauer and Luis Scoccola. ‘Multi-parameter Persistence Modules are Generically Indecom- posable’. In:International Mathematics Research Notices2025.5 (Feb. 2025), rnaf034.issn: 1073- 7928.doi:10.1093/imrn/rnaf034. eprint:https://academic.oup.com/imrn/article-pdf/ 2025/5/rnaf034/62170563/rnaf034.pdf.url:https://doi.org/10.1093/imrn/rnaf034

    doi:10.1093/imrn/rnaf034 2025

  6. [5]

    Fibers of point cloud persistence

    David Beers, Heather A Harrington, Jacob Leygonie, Uzu Lim and Louis Theran.Fibers of point cloud persistence. 2024.doi:10.48550/ARXIV.2411.08201.url:https://arxiv.org/abs/ 2411.08201

    work page Pith review arXiv doi:10.48550/arxiv.2411.08201 2024

  7. [6]

    ‘The fiber of persistent homology for trees’

    David Beers and Jacob Leygonie. ‘The fiber of persistent homology for trees’. In:Journal of Applied and Computational Topology9.3 (Sept. 2025).issn: 2367-1734.doi:10.1007/s41468- 025-00213-z.url:http://dx.doi.org/10.1007/s41468-025-00213-z

    work page doi:10.1007/s41468- 2025

  8. [7]

    Kepple, Rui Qi, Zhouchun Shang, Yanan Xing, Yanru An, Nannan Zhang, Yong Hou, Tanya L

    Katherine Benjamin, Aneesha Bhandari, Jessica D. Kepple, Rui Qi, Zhouchun Shang, Yanan Xing, Yanru An, Nannan Zhang, Yong Hou, Tanya L. Crockford, Oliver McCallion, Fadi Issa, Joanna Hester, Ulrike Tillmann, Heather A. Harrington and Katherine R. Bull. ‘Multiscale to- pology classifies cells in subcellular spatial transcriptomics’. In:Nature630.8018 (June...

    work page doi:10.1038/s41586-024-07563-1.url:http://dx.doi.org/ 2024

Show all 50 references
  1. [8]

    ‘Stabilizing Decomposition of Multiparameter Persistence Modules’

    H ˚ avard Bakke Bjerkevik. ‘Stabilizing Decomposition of Multiparameter Persistence Modules’. In: Foundations of Computational Mathematics26.2 (Jan. 2025), pp. 939–998.issn: 1615-3383.doi: 10.1007/s10208-025-09695-w.url:http://dx.doi.org/10.1007/s10208-025-09695-w

    2025 doi

  2. [9]

    Benjamin Blanchette, Thomas Br¨ ustle and Eric J. Hanson. ‘Exact structures for persistence modules’. In:Representations of Algebras and Related Topics. EMS Press, Oct. 2025, pp. 121–160. isbn: 9783985475834.doi:10.4171/ecr/21/4.url:http://dx.doi.org/10.4171/ECR/21/4

    2025 doi

  3. [10]

    Blumberg and Michael Lesnick

    Andrew J. Blumberg and Michael Lesnick. ‘Stability of 2-Parameter Persistent Homology’. In: Foundations of Computational Mathematics24.2 (Oct. 2022), pp. 385–427.issn: 1615-3383.doi: 10.1007/s10208-022-09576-6.url:http://dx.doi.org/10.1007/s10208-022-09576-6

    2022 doi

  4. [11]

    ‘Decomposition of persistence modules’

    Magnus Botnan and William Crawley-Boevey. ‘Decomposition of persistence modules’. In:Pro- ceedings of the American Mathematical Society148.11 (Aug. 2020), pp. 4581–4596.issn: 0002- 9939.doi:10.1090/proc/14790.url:http://dx.doi.org/10.1090/proc/14790

    2020 doi

  5. [12]

    Magnus Bakke Botnan and Michael Lesnick.An Introduction to Multiparameter Persistence

  6. [13]

    ‘On the bottleneck stability of rank decompositions of multi-parameter persistence modules’

    Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot and Luis Scoccola. ‘On the bottleneck stability of rank decompositions of multi-parameter persistence modules’. In:Advances in Math- ematics451 (Aug. 2024), p. 109780.issn: 0001-8708.doi:10.1016/j.aim.2024.109780.url: http://...

    2024

  7. [14]

    2025.doi:10.48550/ARXIV.2505.13412.url:https://arxiv.org/ abs/2505.13412

    Thomas Br¨ ustle, Steve Oudot, Luis Scoccola and Hugh Thomas.Counts and end-curves in two- parameter persistence. 2025.doi:10.48550/ARXIV.2505.13412.url:https://arxiv.org/ abs/2505.13412

    2025 doi arXiv

  8. [15]

    ‘Topological spaces of persistence modules and their properties’

    Peter Bubenik and Tane Vergili. ‘Topological spaces of persistence modules and their properties’. In:Journal of Applied and Computational Topology2.3-4 (Dec. 2018), pp. 233–269.issn: 2367- 1734.doi:10.1007/s41468-018-0022-4.url:http://dx.doi.org/10.1007/s41468-018- 0022-4

    2018 doi

  9. [16]

    ‘The Theory of Multidimensional Persistence’

    Gunnar Carlsson and Afra Zomorodian. ‘The Theory of Multidimensional Persistence’. In:Dis- crete &; Computational Geometry42.1 (Apr. 2009), pp. 71–93.issn: 1432-0444.doi:10.1007/ s00454-009-9176-0.url:http://dx.doi.org/10.1007/s00454-009-9176-0

    2009 doi

  10. [17]

    Catanzaro, Justin M

    Michael J. Catanzaro, Justin M. Curry, Brittany Terese Fasy, J¯ anis Lazovskis, Greg Malen, Hans Riess, Bei Wang and Matthew Zabka. ‘Moduli spaces of morse functions for persistence’. In:Journal of Applied and Computational Topology4.3 (June 2020), pp. 353–385.issn: 2367- 1734...

    2020 doi

  11. [18]

    Guibas and Steve Y

    Fr´ ed´ eric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas and Steve Y. Oudot. ‘Proximity of persistence modules and their diagrams’. In:Proceedings of the Twenty-Fifth An- nual Symposium on Computational Geometry. SCG ’09. Aarhus, Denmark: Association for Com- ...

    2009

  12. [19]

    Springer International Publishing, 2016.isbn: 9783319425450.doi:10

    Fr´ ed´ eric Chazal, Vin de Silva, Marc Glisse and Steve Oudot.The Structure and Stability of Persistence Modules. Springer International Publishing, 2016.isbn: 9783319425450.doi:10 . 1007/978-3-319-42545-0.url:http://dx.doi.org/10.1007/978-3-319-42545-0

    2016 doi

  13. [20]

    ‘A multi-parameter persistence framework for mathematical morphology’

    Yu-Min Chung, Sarah Day and Chuan-Shen Hu. ‘A multi-parameter persistence framework for mathematical morphology’. In:Scientific Reports12.1 (Apr. 2022).issn: 2045-2322.doi:10. 1038/s41598-022-09464-7.url:http://dx.doi.org/10.1038/s41598-022-09464-7

    2022 doi

  14. [21]

    ‘The representation theorem of persistence revisited and gen- eralized’

    Ren´ e Corbet and Michael Kerber. ‘The representation theorem of persistence revisited and gen- eralized’. In:Journal of Applied and Computational Topology2.1-2 (July 2018), pp. 1–31.issn: 2367-1734.doi:10.1007/s41468-018-0015-3.url:http://dx.doi.org/10.1007/s41468- 018-0015-3

    2018 doi

  15. [22]

    ‘Decomposition of pointwise finite-dimensional persistence modules’

    William Crawley-Boevey. ‘Decomposition of pointwise finite-dimensional persistence modules’. In:Journal of Algebra and Its Applications14.05 (Mar. 2015), p. 1550066.issn: 1793-6829.doi: 10.1142/s0219498815500668.url:http://dx.doi.org/10.1142/S0219498815500668

    2015 doi

  16. [23]

    ‘The fiber of the persistence map for functions on the interval’

    Justin Curry. ‘The fiber of the persistence map for functions on the interval’. In:Journal of Applied and Computational Topology2.3-4 (Dec. 2018), pp. 301–321.issn: 2367-1734.doi:10. 1007/s41468-019-00024-z.url:http://dx.doi.org/10.1007/s41468-019-00024-z

    2018 doi

  17. [24]

    Dey, Jan Jendrysiak and Michael Kerber.Decomposing Multiparameter Persistence Modules

    Tamal K. Dey, Jan Jendrysiak and Michael Kerber.Decomposing Multiparameter Persistence Modules. 2025.doi:10.48550/ARXIV.2504.08119.url:https://arxiv.org/abs/2504.08119

    2025 doi

  18. [25]

    Marc Fersztand.Harder-Narasimhan filtrations of persistence modules: metric stability. 2024. doi:10.48550/ARXIV.2406.05069.url:https://arxiv.org/abs/2406.05069

    2024 doi arXiv

  19. [26]

    ‘Harder–Narasimhan filtra- tions of persistence modules’

    Marc Fersztand, Emile Jacquard, Vidit Nanda and Ulrike Tillmann. ‘Harder–Narasimhan filtra- tions of persistence modules’. In:Transactions of the London Mathematical Society11.1 (2024), e70003.doi:https : / / doi . org / 10 . 1112 / tlm3 . 70003. eprint:https : / / londmathsoc...

    2024 doi

  20. [27]

    2026.doi:10.48550/ ARXIV.2603.23560.url:https://arxiv.org/abs/2603.23560

    Marc Fersztand and Jan Jendrysiak.Computing the Skyscraper Invariant. 2026.doi:10.48550/ ARXIV.2603.23560.url:https://arxiv.org/abs/2603.23560. 49

    2026 doi

  21. [28]

    ‘Continuation of point clouds via per- sistence diagrams’

    Marcio Gameiro, Yasuaki Hiraoka and Ippei Obayashi. ‘Continuation of point clouds via per- sistence diagrams’. In:Physica D: Nonlinear Phenomena334 (Nov. 2016), pp. 118–132.issn: 0167-2789.doi:10.1016/j.physd.2015.11.011.url:http://dx.doi.org/10.1016/j. physd.2015.11.011

    2016 doi

  22. [29]

    Gardner, Erik Hermansen, Marius Pachitariu, Yoram Burak, Nils A

    Richard J. Gardner, Erik Hermansen, Marius Pachitariu, Yoram Burak, Nils A. Baas, Benjamin A. Dunn, May-Britt Moser and Edvard I. Moser. ‘Toroidal topology of population activity in grid cells’. In:Nature602.7895 (Jan. 2022), pp. 123–128.issn: 1476-4687.doi:10.1038/s41586- 021...

    2022 doi

  23. [31]

    Abigail Hickok, Benjamin Jarman, Michael Johnson, Jiajie Luo and Mason A. Porter. ‘Persistent Homology for Resource Coverage: A Case Study of Access to Polling Sites’. In:SIAM Review 66.3 (2024), pp. 481–500.doi:10.1137/22M150410X

    2024 doi

  24. [32]

    Bryn Keller, Michael Lesnick and Theodore L. Willke. ‘Persistent Homology for Virtual Screen- ing’. In:ChemRxiv2018.1005 (Oct. 2018).doi:10 . 26434 / chemrxiv . 6969260 . v3. eprint: https://chemrxiv.org/doi/pdf/10.26434/chemrxiv.6969260.v3.url:https://chemrxiv. org/doi/abs/10...

    2018

  25. [33]

    2024.doi:10.48550/ARXIV.2405.14302.url:https: //arxiv.org/abs/2405.14302

    Michael Kerber and Florian Russold.Graphcode: Learning from multiparameter persistent ho- mology using graph neural networks. 2024.doi:10.48550/ARXIV.2405.14302.url:https: //arxiv.org/abs/2405.14302

    2024 doi arXiv

  26. [34]

    ‘Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology’

    Claudia Landi and Sara Scaramuccia. ‘Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology’. In:Journal of Combinatorial Optimization44.4 (Apr. 2021), pp. 2347–2374.issn: 1573-2886.doi:10 . 1007 / s10878 - 021 - 00729 - x.url:http : //...

    2021 doi

  27. [35]

    ‘The Theory of the Interleaving Distance on Multidimensional Persistence Mod- ules’

    Michael Lesnick. ‘The Theory of the Interleaving Distance on Multidimensional Persistence Mod- ules’. In:Foundations of Computational Mathematics15.3 (Mar. 2015), pp. 613–650.issn: 1615- 3383.doi:10.1007/s10208-015-9255-y.url:http://dx.doi.org/10.1007/s10208-015- 9255-y

    2015 doi

  28. [36]

    2023.url:https : //www.albany.edu/~ML644186/840_2022/Math840_Notes_22.pdf

    Michael Lesnick.Notes on Multiparameter Persistence (for AMAT 840). 2023.url:https : //www.albany.edu/~ML644186/840_2022/Math840_Notes_22.pdf

    2023

  29. [37]

    2015.doi:10.48550/ARXIV.1512.00180.url:https://arxiv.org/abs/1512.00180

    Michael Lesnick and Matthew Wright.Interactive Visualization of 2-D Persistence Modules. 2015.doi:10.48550/ARXIV.1512.00180.url:https://arxiv.org/abs/1512.00180

    2015 doi arXiv

  30. [38]

    ‘Fiber of persistent homology on morse functions’

    Jacob Leygonie and David Beers. ‘Fiber of persistent homology on morse functions’. In:Journal of Applied and Computational Topology7.1 (Oct. 2022), pp. 89–102.issn: 2367-1734.doi:10. 1007/s41468-022-00100-x.url:http://dx.doi.org/10.1007/s41468-022-00100-x

    2022 doi

  31. [39]

    ‘Algorithmic reconstruction of the fiber of persistent homology on cell complexes’

    Jacob Leygonie and Gregory Henselman-Petrusek. ‘Algorithmic reconstruction of the fiber of persistent homology on cell complexes’. In:Journal of Applied and Computational Topology8.7 (Apr. 2024), pp. 2015–2049.issn: 2367-1734.doi:10.1007/s41468-024-00165-w.url:http: //dx.doi.o...

    2024 doi

  32. [40]

    ‘The fiber of persistent homology for simplicial complexes’

    Jacob Leygonie and Ulrike Tillmann. ‘The fiber of persistent homology for simplicial complexes’. In:Journal of Pure and Applied Algebra226.12 (2022), p. 107099.issn: 0022-4049.doi:https: //doi.org/10.1016/j.jpaa.2022.107099.url:https://www.sciencedirect.com/science/ article/pi...

    2022

  33. [41]

    Alicja Maksymiuk, Alexandre Duplessis, Michael Bronstein, Alexander Tong, Fernanda Duarte and ˙Ismail ˙Ilkan Ceylan.MacroGuide: Topological Guidance for Macrocycle Generation. 2026. arXiv:2602.14977 [cs.LG].url:https://arxiv.org/abs/2602.14977. 50

    2026

  34. [42]

    Ezra Miller and Bernd Sturmfels.Combinatorial Commutative Algebra. en. 2005th ed. Graduate Texts in Mathematics. New York, NY: Springer, Dec. 2004

    2004

  35. [43]

    Nardini, Bernadette J

    John T. Nardini, Bernadette J. Stolz, Kevin B. Flores, Heather A. Harrington and Helen M. Byrne. ‘Topological data analysis distinguishes parameter regimes in the Anderson-Chaplain model of angiogenesis’. In:PLOS Computational Biology17.6 (June 2021). Ed. by Mark Chap- lain, e...

    2021 doi

  36. [44]

    ‘On the Stability of Multigraded Betti Numbers and Hilbert Functions’

    Steve Oudot and Luis Scoccola. ‘On the Stability of Multigraded Betti Numbers and Hilbert Functions’. In:SIAM Journal on Applied Algebra and Geometry8.1 (Jan. 2024), pp. 54–88. issn: 2470-6566.doi:10.1137/22M1489150. eprint:https://doi.org/10.1137/22M1489150. url:https://doi.o...

    2024 doi

  37. [45]

    ‘On the Stability of Multigraded Betti Numbers and Hilbert Functions’

    Steve Oudot and Luis Scoccola. ‘On the Stability of Multigraded Betti Numbers and Hilbert Functions’. In:SIAM Journal on Applied Algebra and Geometry8.1 (Jan. 2024), pp. 54–88. issn: 2470-6566.doi:10.1137/22m1489150.url:http://dx.doi.org/10.1137/22M1489150

    2024 doi

  38. [46]

    S´ anchez-Garc ´ ıa

    Ysanne Pritchard, Aikta Sharma, Claire Clarkin, Helen Ogden, Sumeet Mahajan and Rub´ en J. S´ anchez-Garc ´ ıa. ‘Persistent homology analysis distinguishes pathological bone microstructure in non-linear microscopy images’. In:Scientific Reports13.1 (Feb. 2023).issn: 2045-2322....

    2023 doi

  39. [47]

    ‘Differen- tiability and optimization of multiparameter persistent homology’

    Luis Scoccola, Siddharth Setlur, David Loiseaux, Mathieu Carri` ere and Steve Oudot. ‘Differen- tiability and optimization of multiparameter persistent homology’. In:Proceedings of the 41st International Conference on Machine Learning. ICML’24. Vienna, Austria: JMLR.org, 2024

    2024

  40. [48]

    ‘Generic families of finite metric spaces with identical or trivial 1-dimensional persistence’

    Philip Smith and Vitaliy Kurlin. ‘Generic families of finite metric spaces with identical or trivial 1-dimensional persistence’. In:Journal of Applied and Computational Topology8.3 (May 2024), pp. 839–855.issn: 2367-1734.doi:10.1007/s41468-024-00177-6.url:http://dx.doi.org/ 10...

    2024 doi

  41. [49]

    Bull, Philip S

    Oliver Vipond, Joshua A. Bull, Philip S. Macklin, Ulrike Tillmann, Christopher W. Pugh, Helen M. Byrne and Heather A. Harrington. ‘Multiparameter persistent homology landscapes identify immune cell spatial patterns in tumors’. In:Proceedings of the National Academy of Sciences...

    2021 doi

  42. [2023]

    arXiv:2203.14289 [math.AT]

    arXiv

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.