Skip to content

Implementation bibliography

These references support the implementation accounts. Each entry identifies what the source contributes: a mathematical construction, software used by TamerOp, or a related method that helps explain a choice. The linked accounts give the assumptions under which those contributions apply.

Nemo and Hecke

Claus Fieker, William Hart, Tommy Hofmann, and Fredrik Johansson. Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language. ISSAC 2017, 157–164. DOI: 10.1145/3087604.3087611 · Open manuscript · Matrix API.

TamerOp delegates selected exact matrix operations to Nemo. This paper explains how Julia algorithms work with specialized native libraries; the optional Hecke extension also uses Hecke's algebra computations when certifying rational indecomposable summands. Use in the coordinate account.

FLINT

The FLINT team. FLINT: Fast Library for Number Theory. Project and citation guidance · Rational matrices · Rational reconstruction.

FLINT supplies exact arithmetic through Nemo and documents the bounds used in rational reconstruction. The online matrix manual describes its solving algorithms. Use in the coordinate account.

Rational reconstruction

Paul S. Wang, M. J. T. Guy, and J. H. Davenport. P-adic reconstruction of rational numbers. ACM SIGSAM Bulletin 16(2), 2–3, 1982. DOI: 10.1145/1089292.1089293 · Paper scan.

The uniqueness argument for reconstructing small rational numbers from modular residues comes from this mathematical background. TamerOp implements reconstruction locally and checks the resulting candidate against the original matrix equation. Use in the coordinate account.

Dixon lifting

John D. Dixon. Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40, 137–141, 1982. DOI: 10.1007/BF01459082.

Dixon's method lifts a solution through powers of one prime. It provides context for exact solvers available in dependencies; TamerOp's local modular solver instead combines independent primes using the Chinese remainder theorem. Use in the coordinate account.

Generalized rank

Woojin Kim and Facundo Mémoli. Generalized Persistence Diagrams for Persistence Modules over Posets. Journal of Applied and Computational Topology 5, 533–581, 2021. DOI: 10.1007/s41468-021-00075-1.

This paper defines generalized rank through the map from a limit to a colimit and develops the associated generalized persistence diagrams. TamerOp constructs finite constraint and relation matrices locally, and limits signed reconstruction to the caller's declared family.

Boundary zigzags

Tamal K. Dey, Woojin Kim and Facundo Mémoli. Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications. Discrete & Computational Geometry 71, 67–94, 2024. DOI: 10.1007/s00454-023-00584-z. Accessible construction and theorem.

This work characterizes generalized rank by intervals spanning a path around the boundary of a finite connected convex grid interval. TamerOp retains repeated path occurrences and computes its barcode by bounded exact rank inversion; it does not reuse the paper's specialized filtration-level zigzag reduction.

Generalized-rank invariant landscapes

Cheng Xin, Soham Mukherjee, Shreyas N. Samaga, and Tamal K. Dey. GRIL: A 2-parameter Persistence Based Vectorization for Machine Learning. Proceedings of Machine Learning Research 221, 2023. Paper and proceedings record.

This paper defines the continuous worm regions and their generalized rank landscapes. TamerOp's implementation on supported grids contracts constant fibers and searches exact critical widths; it does not reuse the paper's filtration-level zigzag implementation.

Bigraded Betti numbers and presentation diagrams

The RIVET developers. Mathematical preliminaries, RIVET documentation. Invariant definitions.

The preliminaries explain minimal multigraded free resolutions and their Betti numbers, providing context for the corresponding pictures. The finite-poset resolution views use TamerOp's own stored projective/injective terms and verification algorithms; supplied grade coordinates alone do not identify those terms with an ambient free resolution. No RIVET algorithm or code is used by the renderer. Use in the visual-specification account.

Signed barcodes and prominence

Magnus Bakke Botnan, Steffen Oppermann and Steve Oudot. Signed Barcodes for Multi-parameter Persistence via Rank Decompositions and Rank-Exact Resolutions. Foundations of Computational Mathematics 25, 1815–1874, 2025. DOI: 10.1007/s10208-024-09672-9.

This paper supplies the mathematical definitions and visualization conventions. Sections 6.1–6.2 explain signed rectangle diagonals, signed side-length prominence and smoothing through images of shift maps. The visual specification account applies these to supplied signed rank data with explicit endpoint conventions. This is not a dependency on external plotting software.

Kan extensions and adjunctions

Emily Riehl. Category Theory in Context. Dover, 2016. Author's book page.

This is the mathematical reference for limits, colimits, natural transformations, adjunctions and Kan extensions. Chapter 6, including the pointwise colimit formula in Theorem 6.2.1, supplies the categorical setting. TamerOp's finite relation matrices, coordinate choices and verification are local implementations on the chosen finite encoding. Use in the transport account.

Yoneda composition and differential graded products

The Stacks Project Authors. Ext groups, Section 13.27, Tag 06XP, and Differential graded algebras, Section 22.3, Tag 061U.

These sections explain Ext composition, its interpretation through extensions, and compatibility between differentials and products. TamerOp's generator-block lifts, coordinate tables, Tor descent checks and visual preparation are local implementations. The product account states the concrete grading conventions and the difference between chain compatibility and associativity on homology.

Makie rendering

  • Makie coordinate spaces and layout observables: backend mechanisms used to attach composition annotations to data viewports and measured coefficient labels.
  • Makie's segment, polygon, and text recipes provide the batched drawing primitives used by the shared renderer. TamerOp owns the preparation of the mathematical layers, their drawing order and exact table layout.

Rhomboid and multicover constructions

René Corbet, Michael Kerber, Michael Lesnick and Georg Osang. Computing the multicover bifiltration. Open manuscript, version 3. The rhomboid model, integer-depth slicing and comparison with multicover supply the mathematical model of the exact construction account. The positive-depth coordinate in its figures explicitly reflects the usual negative-depth axis.

Herbert Edelsbrunner and Georg Osang. A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes. Open manuscript. Algorithm 1 supplies the subset-label recovery behind the incremental weighted-Delaunay discovery route; TamerOp's rational hull rebuilding and backend selection are separate implementation choices.

Andrew J. Blumberg and Michael Lesnick. Stability of 2-parameter persistent homology. Open manuscript, version 3. Section 4 supplies the subdivision–Čech/multicover comparison. It supports the labelled flag model for degenerate inputs, independently of the inspector's noninjective schematic layout.

Ulrich Bauer, Michael Kerber, Fabian Roll and Alexander Rolle. A Unified View on the Functorial Nerve Theorem and its Variations. Open manuscript, version 6. Theorem 5.9(1b), Corollary 5.16 and Proposition 5.19 justify the closed-cover hypotheses used for exact birth contacts in the implementation account.

Multiparameter persistence landscapes

Oliver Vipond. Multiparameter Persistence Landscapes. Journal of Machine Learning Research 21(61), 2020. Paper.

The diagonal landscape interpretation supplies the mathematical meaning of landscape queries at ambient parameters, as explained in the feature transform account.

Ensemble mean uncertainty

  • Wassily Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963), 13–30. Paper. Supplies the bounded-mean inequality used with a finite union bound in ensemble computations.
  • Inés García-Redondo, Anthea Monod and Qiquan Wang, Confidence Bands for Multiparameter Persistence Landscapes. arXiv:2504.01113. Develops functional mean-landscape inference; the ensemble implementation's bootstrap on finitely many probes does not automatically inherit its theorem over a continuous domain.

Relative homology and filtered pairs

Allen Hatcher. Algebraic Topology. Cambridge University Press, 2002, Section 2.1. Author's chapter.

This reference develops quotient chain complexes and the natural long exact homology sequence; the relative-persistence account uses the boundary-of-a-lift convention for its connecting map.

Nello Blaser and Morten Brun. Relative Persistent Homology. Discrete & Computational Geometry 68, 949–963, 2022. DOI: 10.1007/s00454-022-00421-9.

This paper develops the persistent quotient viewpoint and relative geometric constructions. The general filtered-pair implementation is local; it does not implement the paper's specialized relative Delaunay–Čech construction.

Interval summand multiplicities

Hideto Asashiba and Enhao Liu. Interval Multiplicities of Persistence Modules. arXiv:2411.11594v6, 2026.

This paper studies multiplicities over finite posets. Its criterion in Lemma 3.39 uses degree zero top and socle data to restrict the possible interval endpoints. TamerOp implements that pruning criterion with endpoint antichains. Its local multiplicity engine uses the Hom composition pairing proved in the algorithm account; it does not implement this paper's specialized presentation formulas, essential covers or filtration-level reductions.

Parameter atlas figures

David Loiseaux and Hannah Schreiber. multipers: Multiparameter Persistence for Machine Learning. Journal of Open Source Software 9(103), 6773, 2024. DOI: 10.21105/joss.06773.

Figure 1 provides a visual precedent for keeping a grid of source filtration states visible together in the atlas inspector.

Marc Fersztand and Jan Jendrysiak. Computing the Skyscraper Invariant. SoCG 2026, LIPIcs 367, 47:1–47:23. DOI: 10.4230/LIPIcs.SoCG.2026.47.

Figure 3 relates a sampled bifiltration to its homology diagram. This motivates the atlas's linked source states and maps; the atlas does not compute the Skyscraper invariant.