---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22291'
abstract:
- lang: eng
  text: Persistent homology is a fundamental tool in Topological Data Analysis. The
    associated algebraic structure is the persistence module, a sequence of vector
    spaces connected by linear maps. Persistence modules admit a complete and fast-to-compute
    invariant known as the persistence diagram. However, this is no longer the case
    for maps between persistence modules (i.e. persistence maps). We propose a new
    invariant for persistence maps, consisting of a partial matching between the persistence
    diagrams of the domain and codomain modules. We show that this invariant is additive
    with respect to the direct sum decomposition of persistence maps, is more discriminative
    than the image module, and is computable in cubic time. Furthermore, we provide
    an implementation and demonstrate its efficiency by integrating it with edge collapse
    techniques for flag complexes (e.g., Vietoris–Rips complexes). As a key technical
    contribution, we describe how to induce a persistence map between two flag complexes
    that have been independently simplified via edge collapses, even when a direct
    simplicial map between them is no longer available.
acknowledgement: This project was partially funded by MCIN/AEI and the NextGenerationEU/PRTR,
  under project TED2021-129438B-I00. The authors thank IMUS-Maria de Maeztu grant
  CEX2024-001517-M - Apoyo a Unidades de Excelencia María de Maeztu for supporting
  this research, funded by MICIU/AEI/ 10.13039/501100011033. The authors would also
  like to thank Lars M Salbu for fruitful discussions regarding the operators from
  Definition 4.1 and their relation with the order relations introduced in Definition
  3.2.
article_number: '102598'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rocio
  full_name: Gonzalez-Diaz, Rocio
  last_name: Gonzalez-Diaz
- first_name: Manuel
  full_name: Soriano Trigueros, Manuel
  id: 15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8
  last_name: Soriano Trigueros
  orcid: 0000-0003-2449-1433
- first_name: Alvaro
  full_name: Torras-Casas, Alvaro
  last_name: Torras-Casas
citation:
  ama: Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. Additive partial matchings
    induced by persistence maps. <i>Journal of Symbolic Computation</i>. 2026;138.
    doi:<a href="https://doi.org/10.1016/j.jsc.2026.102598">10.1016/j.jsc.2026.102598</a>
  apa: Gonzalez-Diaz, R., Soriano Trigueros, M., &#38; Torras-Casas, A. (2026). Additive
    partial matchings induced by persistence maps. <i>Journal of Symbolic Computation</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.jsc.2026.102598">https://doi.org/10.1016/j.jsc.2026.102598</a>
  chicago: Gonzalez-Diaz, Rocio, Manuel Soriano Trigueros, and Alvaro Torras-Casas.
    “Additive Partial Matchings Induced by Persistence Maps.” <i>Journal of Symbolic
    Computation</i>. Elsevier, 2026. <a href="https://doi.org/10.1016/j.jsc.2026.102598">https://doi.org/10.1016/j.jsc.2026.102598</a>.
  ieee: R. Gonzalez-Diaz, M. Soriano Trigueros, and A. Torras-Casas, “Additive partial
    matchings induced by persistence maps,” <i>Journal of Symbolic Computation</i>,
    vol. 138. Elsevier, 2026.
  ista: Gonzalez-Diaz R, Soriano Trigueros M, Torras-Casas A. 2026. Additive partial
    matchings induced by persistence maps. Journal of Symbolic Computation. 138, 102598.
  mla: Gonzalez-Diaz, Rocio, et al. “Additive Partial Matchings Induced by Persistence
    Maps.” <i>Journal of Symbolic Computation</i>, vol. 138, 102598, Elsevier, 2026,
    doi:<a href="https://doi.org/10.1016/j.jsc.2026.102598">10.1016/j.jsc.2026.102598</a>.
  short: R. Gonzalez-Diaz, M. Soriano Trigueros, A. Torras-Casas, Journal of Symbolic
    Computation 138 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The code used for the computational experiments is available
  in https://github.com/Cimagroup/IBloFunMatch
date_created: 2026-07-13T09:43:38Z
date_published: 2026-06-23T00:00:00Z
date_updated: 2026-07-13T12:00:07Z
day: '23'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1016/j.jsc.2026.102598
external_id:
  arxiv:
  - '2006.11100'
fulldoi: https://doi.org/10.1016/j.jsc.2026.102598
has_accepted_license: '1'
intvolume: '       138'
keyword:
- Persistence module
- Persistence map
- Persistent homology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.jsc.2026.102598
mathsc:
- 55N31
- 16G20
month: '06'
oa: 1
oa_version: Published Version
publication: Journal of Symbolic Computation
publication_identifier:
  eissn:
  - 1095-855X
  issn:
  - 0747-7171
publication_status: epub_ahead
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: no
title: Additive partial matchings induced by persistence maps
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '20585'
abstract:
- lang: eng
  text: Motivated by applications in medical sciences, we study finite chromatic sets
    in Euclidean space from a topological perspective. Based on the persistent homology
    for images, kernels and cokernels, we design provably stable homological quantifiers
    that describe the geometric micro- and macro-structure of how the color classes
    mingle. These can be efficiently computed using chromatic variants of Delaunay
    and alpha complexes, and code that does these computations is provided.
acknowledgement: "This project has received funding from the European Research\r\nCouncil
  (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme,
  grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund\r\n(FWF), grant
  no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization
  in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastiano
  full_name: Cultrera di Montesano, Sebastiano
  id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
  last_name: Cultrera di Montesano
  orcid: 0000-0001-6249-0832
- first_name: Ondrej
  full_name: Draganov, Ondrej
  id: 2B23F01E-F248-11E8-B48F-1D18A9856A87
  last_name: Draganov
  orcid: 0000-0003-0464-3823
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Morteza
  full_name: Saghafian, Morteza
  id: f86f7148-b140-11ec-9577-95435b8df824
  last_name: Saghafian
citation:
  ama: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic
    alpha complexes. <i>Foundations of Data Science</i>. 2026;8:30-62. doi:<a href="https://doi.org/10.3934/fods.2025003">10.3934/fods.2025003</a>
  apa: Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian,
    M. (2026). Chromatic alpha complexes. <i>Foundations of Data Science</i>. AIMS.
    <a href="https://doi.org/10.3934/fods.2025003">https://doi.org/10.3934/fods.2025003</a>
  chicago: Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner,
    and Morteza Saghafian. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>.
    AIMS, 2026. <a href="https://doi.org/10.3934/fods.2025003">https://doi.org/10.3934/fods.2025003</a>.
  ieee: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian,
    “Chromatic alpha complexes,” <i>Foundations of Data Science</i>, vol. 8. AIMS,
    pp. 30–62, 2026.
  ista: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. Chromatic
    alpha complexes. Foundations of Data Science. 8, 30–62.
  mla: Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” <i>Foundations
    of Data Science</i>, vol. 8, AIMS, 2026, pp. 30–62, doi:<a href="https://doi.org/10.3934/fods.2025003">10.3934/fods.2025003</a>.
  short: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Foundations
    of Data Science 8 (2026) 30–62.
corr_author: '1'
date_created: 2025-11-02T23:01:33Z
date_published: 2026-03-01T00:00:00Z
date_updated: 2026-10-02T11:56:12Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.3934/fods.2025003
ec_funded: 1
external_id:
  arxiv:
  - '2212.03128'
fulldoi: https://doi.org/10.3934/fods.2025003
has_accepted_license: '1'
intvolume: '         8'
keyword:
- Topological data analysis
- Delaunay mosaic
- alpha complex
- chromatic sets
- persistent homology
- kernel/image/cokernel persistent homology
- radius function
- discrete Morse theory
- exact sequences
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2212.03128
mathsc:
- 62R40
- 55N31
- 68T09
- 57Q70
month: '03'
oa: 1
oa_version: Preprint
page: 30-62
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '788183'
  name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I02979-N35
  name: Persistence and stability of geometric complexes
publication: Foundations of Data Science
publication_identifier:
  eissn:
  - 2639-8001
publication_status: published
publisher: AIMS
quality_controlled: '1'
related_material:
  record:
  - id: '15091'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Chromatic alpha complexes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2026'
...
