Pith. sign in

REVIEW 2 major objections 5 minor 41 references

The Intersection Euler Characteristic Profile: Euler Calculus and Stability for Topological Interaction of Ball Unions

T0 review · 2 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read The paper proves that the Euler characteristic of the common overlap of thickened point clouds is the canonical, stable, computable descriptor of multi-cloud interaction.

desk verdict A solid, well-proven interaction invariant; sampling consistency rests on an unproven tameness hypothesis that the abstract underplays. read the letter →

arxiv 2608.06180 v1 pith:LKEB2MUZ submitted 2026-08-06 math.AT cs.CG

Kazuhiro Kawamura , Sushovan Majhi , Atish Mitra This is my paper · ORCID
classification math.ATcs.CG MSC 55N3162R4055U9957N99
keywords Eulercharacteristiccalculusintersectionprofiletopologicalinteractionballunionsstabilitysamplingconsistencyalphacomplex
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

The paper tries to establish that the right numerical measure of how k point clouds interact is the Euler characteristic of their thickened common overlap, one integer per vector of scales. It proves that this Intersection Euler Characteristic Profile, Δχ(t) = χ(∩_i U(X_i; t_i)), is not an ad hoc choice: among all pointwise-Euler interaction profiles obeying separation and normalization, it is the only one, and even the Euler characteristic itself is forced by natural axioms. The construction is rigid-motion invariant, scale-equivariant, and L1-stable under Hausdorff perturbation, and a single sorted Alpha-complex sweep computes it in O($n^{{ceil(d/2)}}$ log n) time without persistence reduction. The paper then shows that as clouds densify inside compact shapes, the profile recovers the true overlap topology, persistently at regular scales and exactly at sample-regular scales, with explicit sample complexity. A relative-homology refinement catches the balanced Betti numbers that the alternating Euler sum cancels.

What carries the argument

The carrying object is the Euler integral with respect to Euler characteristic — counting a space by the alternating sum of its Betti numbers — applied to the pointwise product of the k data-dependent offset indicators. Its load-bearing identity, the Intersection Theorem, asserts that Δχ(t) = ∫ ∏_i 1_{U(X_i; t_i)} dχ = χ(∩_i U(X_i; t_i)); this commuting-square interchange turns geometric intersection into algebraic multiplication, which is what makes canonicity provable, stability a continuity property of the offset inclusions, and computation a signed simplex count rather than a persistence reduction.

What would settle it

Search for compact positive-reach sets whose common-intersection filtration has infinitely many homological critical values inside the reach window, or has infinite-dimensional homology at some scale; finding such a configuration would refute the uniform band-recovery and sample-complexity claims. Alternatively, brute-force check the universality theorem on random indicator tuples for any pointwise function φ satisfying the separation and normalization axioms: any disagreement with the product ∏ ε_i would falsify Theorem 2.16.

Watch

Extended reading notes

Core claim

The central claim is that the interaction of k colored point clouds is captured, scale by scale, by the integer χ(∩_i U(X_i; t_i)): the Euler characteristic of the region where all k thickened clouds meet. The Intersection Theorem identifies this with the Euler integral of the product of the offset indicators, making geometric intersection and algebraic multiplication interchangeable under integration with respect to Euler characteristic. Theorem 2.16 states that this profile is the unique pointwise-Euler interaction descriptor satisfying Separation and Normalization, and Theorem 2.17 removes even the Euler-integral assumption, deriving χ itself from multivaluation, topological invariance, separation, and normalization. The profile is L1-stable with explicit constants, the underlying intersection filtration is bottleneck-stable, and the invariant is computed by a signed Alpha-complex count whose O($n^{{ceil(d/2)}}$ log n) running time is worst-case optimal in even dimensions. Under sampling, the profile and its relative-homology refinement consistently recover the homology and Euler characteristic of the limiting shapes.

Load-bearing premise

The load-bearing premise for the sampling consistency theorems is that the population-level intersection filtration of the thickened positive-reach shapes has only finitely many homological critical values and finite-dimensional homology at every scale; the paper assumes this rather than proving it.

Editorial extensions

If this is right

  • The uniqueness theorem that the profile is forced by Separation and Normalization means that any other pointwise-Euler scalar descriptor of multi-cloud interaction must either violate one of those axioms or coincide with χ(∩_i U(X_i; t_i)).
  • The L1-stability bound means that a Hausdorff perturbation of the clouds by ε moves the whole interaction curve by at most 2ε(N+N′) in integrated absolute value, so the curve can be used directly as a loss or test statistic without vectorization.
  • The Alpha-complex sweep computes the full profile at every scale in a single pass over sorted simplices, without forming a boundary matrix, making the method practical at population scale where persistence reduction would be prohibitive.
  • For positive-reach shapes, finitely many i.i.d. samples suffice to recover χ of the population overlap exactly at all regular scales outside an O(ε)-measure exceptional set, with sample size depending on the intrinsic dimension of each shape rather than the ambient dimension.
  • Where the Euler characteristic cancels balanced Betti numbers, the symmetrized relative interaction module is interleaving-stable and detects the interaction, at the price of giving up the scalar simplicity of the profile.
  • Each floor χ(C_j) of the interaction spectrum — the Euler characteristic of the region where at least j clouds meet — is fixed by its own separation and normalization axioms, so the whole spectrum is canonical, not just its top floor.

Reading between the lines

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

  • The paper leaves implicit that the uniqueness theorem can be read as an axiomatic impossibility: any attempt to define a different pointwise-Euler interaction scalar while keeping separation and normalization will reproduce χ(∩_i U(X_i; t_i)); auditing existing scalar interaction summaries against these axioms would show which one each violates.
  • Since the L1 bound is worst-case and the profile is integer-valued, typical random configurations may behave far better than 2ε(N+N′); an empirical study of the ratio d_L1/(ε(N+N′)) on synthetic and real clouds would show how conservative the bound is.
  • The interleaving stability of the relative module suggests a permutation-free hypothesis-testing pipeline: on the diagonal, bottleneck stability of the one-parameter relative barcode could yield confidence sets for interaction under sampling noise, though the paper does not develop the distribution theory.
  • For odd ambient dimensions, the algorithm retains a factor-n gap to the lower bound; finding a direct O(n^{floor(d/2)} log n) computation for Δχ in odd d would close the final complexity question.
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 / 5 minor

Summary. The paper introduces the Intersection Euler Characteristic Profile (Intersection ECP) Δχ(t) = χ(∩_i U(X_i; t_i)) for k pairwise disjoint finite point clouds in R^d, and develops its Euler-calculus interpretation as the integral of a product of indicator functions. The main results are: the Intersection Theorem identifying the Euler integral with the Euler characteristic of the overlap; axiomatic canonicity theorems (Theorems 2.16 and 2.17) forcing the product combination and the Euler characteristic; bottleneck and L1 stability of the diagonal profile (Theorem 2.12); multiparameter stability; an interaction spectrum; a relative-homology refinement with interleaving stability (Theorem 4.2); sampling-consistency results with explicit sample complexity under bounded-reach hypotheses (Theorems 5.5 and 5.6, Corollary 5.8); and an Alpha-complex algorithm with complexity O(n^{ceil(d/2)} log n) and a lower bound in even dimensions (Theorems 6.4–6.5, Proposition 6.6). The paper is candid that the Intersection Theorem is tautological in nature, and its claimed contribution is the axiomatic, stability, algorithmic, and sampling framework built around the invariant.

Significance. If the sampling-consistency claims hold, the Intersection ECP is a genuinely attractive measurement: integer-valued, cheap to compute, stable, canonical under natural axioms, and free of persistence reduction. The paper's strengths are its explicit statements, the careful use of standard interleaving and bottleneck arguments, the reduction-free Alpha-complex algorithm with a matching lower bound in even dimensions, and the candor about the tautological core of the identity. The universality theorems provide a useful conceptual clarification of why the product combination, not merely the Euler characteristic, is natural. The main caveat is that the advertised 'under positive reach' consistency is not established as stated, because the sampling theorems rest on a tameness hypothesis for the population intersection filtration that is not proven for positive-reach inputs. This is a load-bearing gap for one of the paper's central advertised claims, although it appears reparable either by proving the needed tameness or by restating the theorems under the explicit hypothesis.

major comments (2)
  1. [§5, Standing hypotheses before Theorem 5.5; Theorems 5.5, 5.6, Corollary 5.8] The sampling consistency theorems are stated only under the standing hypothesis that ρ ↦ T_ρ = ∩_i U(A_i; ρ) has finitely many homological critical values in (0, τ) and finite-dimensional homology at every scale. This hypothesis is not proven for compact positive-reach sets A_i, and Lemma 5.3 does not establish it: Lemma 5.3 proves that each A_i is a compact ANR with finite-dimensional homology, but T_ρ is the sublevel set of F = max_i d_{A_i}, a semiconcave function, and T_ρ need not inherit positive reach from the A_i. Semiconcave functions can have infinitely many critical values accumulating, so it is not automatic that Crit(T) is finite. The regular-scale argument in the proof of Theorem 5.5, the definition ε = (1/2) dist(r, Crit(T)) in Theorem 5.6, and the set E_T in Corollary 5.8 all depend on finiteness of Crit(T). Consequently the abstract's unconditional 'under positive reach' recovery claim is not established. Please either prove that compact positive-reach A_i imply the required tameness of T_ρ, or state the sampling theorems under the explicit tameness hypothesis and adjust the abstract and Section 1.1 accordingly.
  2. [§5.3, Theorem 5.6] The quantitative sample-complexity theorem adds hypotheses that are not consequences of positive reach: each A_i must have finite k_i-dimensional Hausdorff volume, and each sampling measure μ_i must have density bounded below with respect to k_i-dimensional Hausdorff measure. These are natural assumptions for explicit rates, but the abstract's concise phrasing 'under positive reach, persistently and with explicit sample complexity' should not be read as claiming these follow from reach alone. Please make the full hypothesis set explicit in the theorem statement and in the summary of contributions, so that the scope of the advertised guarantee is unambiguous.
minor comments (5)
  1. [Abstract and §6, Algorithm 1] The abstract and Section 1.1 say 'a single sorted Alpha-complex sweep' computes the profile, but Algorithm 1 computes three Alpha filtrations (for X, Y, and X∪Y) and merges their critical scales; please rephrase to avoid overpromising a single sweep.
  2. [§5, Standing hypotheses] The phrase 'homological critical values' for the population filtration ρ ↦ T_ρ is used before it is defined for infinite compact sets; Definition 2.9 is written for finite clouds. Please add a definition or a reference for the population case.
  3. [§3.5, Proposition 3.12(3)] The constant C_W is described in the statement as determined by the supremum and the total volume of the critical loci, but the proof obtains it via tube volumes of semi-algebraic strata; please make the dependence explicit or state the bound as O(ε) with a constant depending on W and the configuration.
  4. [Figure 5 caption] The caption contains the fragment 'cubical sublevel filtration of max(d_X, d_Y); 35', which looks like a leftover working note; please clarify the construction and remove the unexplained '35'.
  5. [§1.3, Table] The table row 'Exact integer readout' is slightly misleading because exact recovery is guaranteed only at sample-regular scales (Theorem 5.5); the surrounding text says this, so please make the table cell conditional or add a footnote.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the Intersection Theorem is an openly labeled tautology, while canonicity, stability, and sampling rest on independent axioms and external results.

full rationale

The Intersection Theorem (Theorem 2.7) is a definitional consequence of Definition 2.6, the identity ∏ 1_{A_i} = 1_{∩A_i}, and the definition ∫1_A dχ = χ(A); the paper explicitly acknowledges this in the Introduction: "the identity Δχ = χ(intersection) is therefore a tautology, not a calculation." The substantive claims do not reduce to this tautology. Universality (Theorem 2.16) assumes only a pointwise-Euler form plus Separation and Normalization, and then proves φ(s) = ∏ s_i; the product form is derived, not assumed. Theorem 2.17 similarly forces χ itself from a multivaluation and topological-invariance axioms without assuming the Euler integral. Stability (Theorem 2.12) and relative-module stability (Theorem 4.2) are proved from Hausdorff interleavings and external isometry/bottleneck theorems, not from the profile's own definition. Sampling consistency (Theorems 5.5–5.8) follows from the interleaving T_{ρ−ϵ} ⊆ M_ρ ⊆ T_ρ plus regularity of critical scales, with the sample-complexity bound via the external Niyogi–Smale–Weinberger argument. There is a genuine gap, but it is not circular: the standing hypothesis before Theorem 5.5 (finite critical values of T_ρ and finite-dimensional homology, for compact positive-reach A_i) is unproven in the paper, and positive reach alone is not shown to imply it; this weakens the abstract's unconditional "under positive reach" consistency phrasing, but it is a missing-support issue rather than a reduction of a conclusion to its own input. The only constructive self-citation, [21] (Kawamura) for inverse-limit Čech approximation, is a parameter-free theorem with stated assumptions and is not load-bearing for the quantitative recovery results. No fitted parameter is renamed as a prediction, and no uniqueness theorem is imported from the authors to forbid alternatives. The paper is self-contained in its central derivations apart from the explicitly acknowledged definitional identity; score 1 reflects that minor tautological framing rather than substantive circularity.

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

The central claim rests on standard mathematical tools (Euler calculus, nerve theorem, persistence stability, semialgebraic geometry, Niyogi-Smale-Weinberger sampling) and on a few stated domain assumptions. The most fragile is the standing hypothesis of finitely many critical values for the population intersection filtration, which is not proven and is needed for the quantitative sampling theorems. No free parameters are fitted to data, and no new entities are invented.

assumptions (8)
  • standard math Euler integral is a well-defined Z-linear functional via the valuation extension theorem
    Used throughout Section 2 to define the profile; standard in Euler calculus (Schapira, Viro, Curry).
  • standard math Nerve theorem for convex covers
    Used in Lemma 3.3, Proposition 6.2, and Section 4.1 to identify ball unions with Cech and Alpha complexes.
  • standard math Isometry theorem for persistence modules
    Used in Theorem 2.12 to convert interleavings into bottleneck bounds; standard in persistence theory (Chazal et al.).
  • standard math Hardt's semialgebraic triviality theorem
    Used in Proposition 3.12 to control critical loci of the multiparameter intersection filtration.
  • standard math Niyogi-Smale-Weinberger sampling bounds for positive reach sets
    Used in Theorem 5.6 to derive sample complexity; from prior literature.
  • domain assumption Positive reach implies compact ANR and finite-dimensional homology
    Lemma 5.3; restricts the sampling theory to sets with positive reach.
  • domain assumption Population intersection filtration T_rho has finitely many homological critical values and finite-dimensional homology at each scale
    Standing hypothesis before Theorem 5.5; stated but not proven; needed for quantitative consistency results.
  • domain assumption Point clouds are pairwise disjoint
    Definition 2.1; normalization so interaction vanishes at scale zero; relaxing it changes only the zero baseline.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Intersection Euler Characteristic Profile: Euler Calculus and Stability for Topological Interaction of Ball Unions." pith.science (2026). https://pith.science/paper/LKEB2MUZ

@misc{pith2026260806180,
  author       = {Pith},
  title        = {Pith review of: The Intersection Euler Characteristic Profile: Euler Calculus and Stability for Topological Interaction of Ball Unions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LKEB2MUZ}},
  note         = {Machine review of arXiv:2608.06180}
}
abstract

The Intersection Euler Characteristic Profile (Intersection ECP) of $k$ colored point clouds $X_1, \ldots, X_k \subset \mathbb{R}^d$ is the Euler characteristic $\chi(\bigcap_{i=1}^k \mathcal{U}(X_i; t_i))$ of the overlap of their ball unions---an integer-valued, multiparameter invariant of their topological interaction across scales. Its organizing framework is the Euler calculus on constructible functions: the profile is equally the Euler integral $\int \prod_{i=1}^k \mathbf{1}_{\mathcal{U}(X_i; t_i)} \, d\chi$ of the product of the $k$ data-dependent offsets, and this identity---our Intersection Theorem---is a commuting square interchanging geometric intersection and algebraic product. The invariant is rigid-motion invariant, scale-equivariant, and $L^1$-stable, and it is canonical: among pointwise-Euler interaction profiles it is the one forced by separation and normalization, the top floor of a spectrum of descriptors graded by how many clouds meet. For $n$ points a single sorted Alpha-complex sweep computes it in $O(n^{\lceil d/2 \rceil} \log n)$ time with no persistence reduction, worst-case optimal in even dimensions. Where the Euler characteristic cancels, a relative-homology refinement resolves the finer interaction and is stable in the two-parameter interleaving distance. Finally, for increasingly dense samples the profile and its refinement are consistent, recovering the (relative) homology and Euler characteristic of the underlying shapes---in the inverse limit for compact sets, and, under positive reach, persistently and with explicit sample complexity.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 35 canonical work pages

  1. [1]

    S. Basu. A complexity theory of constructible functions and sheaves.Foundations of Compu- tational Mathematics, 15(1):199–279, 2015

    work page 2015

  2. [2]

    H. B. Bjerkevik, M. B. Botnan, and M. Kerber. Computing the interleaving distance is np-hard, 2018

    work page 2018

  3. [3]

    M. B. Botnan and M. Lesnick. An introduction to multiparameter persistence, 2022

    work page 2022

  4. [4]

    Carlsson and A

    G. Carlsson and A. Zomorodian. The theory of multidimensional persistence.Discrete & Computational Geometry, 42(1):71–93, 2009

    2009

  5. [5]

    Chazal, V

    F. Chazal, V. de Silva, M. Glisse, and S. Oudot.The Structure and Stability of Persistence Modules. Springer, 2016

    work page 2016

  6. [6]

    Coste.An Introduction to Semialgebraic Geometry

    M. Coste.An Introduction to Semialgebraic Geometry. Istituti Editoriali e Poligrafici Inter- nazionali, Pisa, 2000. Dottorato di Ricerca in Matematica, Universit`a di Pisa

    work page 2000

  7. [7]

    Cultrera di Montesano, O

    S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian. Chromatic alpha complexes, 2022. 44 KAZUHIRO KAWAMURA, SUSHOVAN MAJHI, AND ATISH MITRA

    work page 2022

  8. [8]

    Cultrera di Montesano, O

    S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian. Chromatic topo- logical data analysis.arXiv preprint arXiv:2406.04102, 2024

    arXiv 2024

Show all 41 references
  1. [9]

    Curry .Sheaves, Cosheaves and Applications

    J. Curry .Sheaves, Cosheaves and Applications. PhD thesis, University of Pennsylvania, 2014

    2014

  2. [10]

    Curry , R

    J. Curry , R. Ghrist, and M. Robinson. Euler calculus with applications to signals and sens- ing. InProceedings of Symposia in Applied Mathematics, volume 70, pages 75–146. American Mathematical Society , 2012

    2012

  3. [11]

    Curry , S

    J. Curry , S. Mukherjee, and K. Turner. How many directions determine a shape and other sufficiency results for two topological transforms.Transactions of the American Mathematical Society, Series B, 9(32):1006–1043, 2022

    2022

  4. [12]

    S. C. di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian. The Euclidean MST- ratio for bi-colored lattices. In32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), volume 320 ofLIPIcs, pages 3:1–3:23. Schloss Dagstuhl – Leibniz- Zentrum f...

    2024 arXiv

  5. [13]

    Dłotko and D

    P. Dłotko and D. Gurnari. Euler characteristic curves and profiles: a stable shape invariant for big data problems.arXiv preprint arXiv:2212.01666v2, 2023

    2023 arXiv

  6. [14]

    Edelsbrunner and J

    H. Edelsbrunner and J. Harer.Computational topology: an introduction. American Mathemat- ical Society , 2010

    2010

  7. [15]

    Edelsbrunner and E

    H. Edelsbrunner and E. P. M ¨ucke. Simulation of simplicity: a technique to cope with degen- erate cases in geometric algorithms.ACM Transactions on Graphics, 9(1):66–104, 1990

    1990

  8. [16]

    Gray .Tubes

    A. Gray .Tubes. Birkh ¨auser, Basel, 2nd edition, 2004

    2004

  9. [17]

    Hacquard and V

    O. Hacquard and V. Lebovici. Euler characteristic tools for topological data analysis.Journal of Machine Learning Research, 25(240):1–39, 2024

    2024

  10. [18]

    Hadwiger.Vorlesungen ¨uber Inhalt, Oberfl¨ache und Isoperimetrie

    H. Hadwiger.Vorlesungen ¨uber Inhalt, Oberfl¨ache und Isoperimetrie. Springer, Berlin, 1957

    1957

  11. [19]

    R. M. Hardt. Semi-algebraic local-triviality in semi-algebraic mappings.American Journal of Mathematics, 102(2):291–302, 1980. doi: 10.2307/2374240

    1980 doi

  12. [20]

    Hatcher.Algebraic Topology

    A. Hatcher.Algebraic Topology. Cambridge University Press, 2002

    2002

  13. [21]

    Kawamura

    K. Kawamura. Inverse sequences of ˇcech complexes and Hausdorff approximation, 2024

    2024

  14. [22]

    D. A. Klain and G.-C. Rota.Introduction to Geometric Probability. Cambridge University Press, 1997

    1997

  15. [23]

    Koenig, S

    B. Koenig, S. Majhi, A. Mitra, A. Stein, and B. Todd. Topological characterization of churn flow and unsupervised correction to the Wu flow-regime map in small-diameter vertical pipes,

  16. [24]

    Lebovici

    V. Lebovici. Hybrid transforms of constructible functions.Foundations of Computational Math- ematics, 22:1839–1881, 2022

    2022

  17. [25]

    M. Lesnick. The theory of the interleaving distance on multidimensional persistence modules. Foundations of Computational Mathematics, 15(3):613–650, 2015

    2015

  18. [26]

    Majhi, A

    S. Majhi, A. Mitra, S. Nandi, M. Nurujjaman, and B. N. Sharma. Detecting regime transitions in dynamical systems via the mixup Euler characteristic profile: When topology helps, and when it does not, 2026

    2026

  19. [27]

    Marde ˇsi´c and J

    S. Marde ˇsi´c and J. Segal.Shape Theory: The Inverse System Approach, volume 26 ofNorth- Holland Mathematical Library. North-Holland, Amsterdam, 1982

    1982

  20. [28]

    Niyogi, S

    P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples.Discrete & Computational Geometry, 39(1–3):419–441, 2008

    2008

  21. [29]

    V. Robins. Towards computing homology from finite approximations.Topology Proceedings, 24(1):503–532, 1999. THE INTERSECTION EULER CHARACTERISTIC PROFILE 45

    1999

  22. [30]

    A. Roy , R. Haque, A. J. Mitra, M. D. Choudhury , S. Tarafdar, and T. Dutta. Understanding flow features in drying droplets via Euler characteristic surfaces—a topological tool.Physics of Fluids, 32(12):123310, 2020

    2020

  23. [31]

    A. Roy , R. Haque, A. J. Mitra, S. Tarafdar, and T. Dutta. Characterizing fluid dynamical systems using Euler characteristic surface and Euler metric.Physics of Fluids, 35(8), 2023

    2023

  24. [32]

    A. Roy , A. J. Mitra, and T. Dutta. Euler characteristic surfaces: A stable multiscale topo- logical summary of time series data.La Matematica, 4:1–25, 2025. doi: 10.1007/ s44007-025-00165-x. arXiv:2408.09400

    2025 arXiv

  25. [33]

    Schapira

    P. Schapira. Operations on constructible functions.Journal of Pure and Applied Algebra, 72 (1):83–93, 1991

    1991

  26. [34]

    B. N. Sharma, V. Mandal, S. R. Luwang, M. Nurujjaman, A. J. Mitra, and S. Majhi. Inter- pretable classification of time series using Euler characteristic surfaces.Scientific Reports,

  27. [35]

    GUDHI user and reference manual.https://gudhi.inria.fr/, 2024

    The GUDHI Project. GUDHI user and reference manual.https://gudhi.inria.fr/, 2024

    2024

  28. [36]

    Turner, S

    K. Turner, S. Mukherjee, and D. M. Boyer. Persistent homology transform for modeling shapes and surfaces.Information and Inference: A Journal of the IMA, 3(4):310–344, 2014

    2014

  29. [37]

    ˇZ. Virk. Rips complexes as nerves and a functorial Dowker-nerve diagram.Mediterranean Journal of Mathematics, 18(2):58, 2021

    2021

  30. [38]

    O. Y. Viro. Some integral calculus based on Euler characteristic.Topology and Geometry— Rohlin Seminar, Lecture Notes in Mathematics, 1346:127–138, 1988

    1988

  31. [39]

    Wagner, S

    H. Wagner, S. Arustamyan, M. Wheeler, and P. Bubenik. Mixup barcodes: quantifying geometric-topological interactions between point clouds.arXiv preprint arXiv:2402.15058, 2024

    2024 arXiv

  32. [40]

    J. E. West. Mapping Hilbert cube manifolds to ANR’s: a solution of a conjecture of Borsuk. Annals of Mathematics, 106(1):1–18, 1977. DEPARTMENT OFMATHEMATICS, UNIVERSITY OFTSUKUBA, JAPAN Email address:kawamura@math.tsukuba.ac.jp DATASCIENCEPROGRAM, GEORGEWASHINGTONUNIVERSITY, ...

    1977

  33. [2026]

    doi: 10.1038/s41598-026-64177-5

    doi

Pith tools

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