On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class

Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a representative in that homology class which is optimal. We stu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chambers, Erin Wolf, Parsa, Salman, Schreiber, Hannah
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Chambers, Erin Wolf
Parsa, Salman
Schreiber, Hannah
description Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a representative in that homology class which is optimal. We study two measures of optimality, namely, the lexicographic order of cycles (the lex-optimal cycle) and the bottleneck norm (a bottleneck-optimal cycle). We give a simple algorithm for computing the lex-optimal cycle for a 1-homology lass in a closed orientable surface. In contrast to this, our main result is that, in the case of 3-Manifolds of size $n^2$ in the Euclidean 3-space, the problem of finding a bottleneck optimal cycle cannot be solved more efficiently than solving a system of linear equations with an $n \times n$ sparse matrix. From this reduction, we deduce several hardness results. Most notably, we show that for 3-manifolds given as a subset of the 3-space of size $n^2$, persistent homology computations are at least as hard as rank computation (for sparse matrices) while ordinary homology computations can be done in $O(n^2 \log n)$ time. This is the first such distinction between these two computations. Moreover, it follows that the same disparity exists between the height persistent homology computation and general sub-level set persistent homology computation for simplicial complexes in the 3-space.
doi_str_mv 10.48550/arxiv.2112.02380
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2112_02380</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2112_02380</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-47026474605bcbd5edaee660b4cb1cde58a965bde82341455983bd18d6af49623</originalsourceid><addsrcrecordid>eNotj81OhDAYRbtxYUYfwJXfC4BtaUtZKlHHhITNrNyQ_oGNhRKoZnh7R3R1c5Obk3sQuiM4Z5Jz_KCWs__OKSE0x7SQ-Bq9txPUcZyDO_u0Qez39pX8NMBTTCm4yZlPUJOF5jIxcVjU_OENtHPyowpQbya4FfwECo5xjCEOG9RBresNuupVWN3tfx7Q6eX5VB-zpn19qx-bTIkSZ6zEVLCSCcy10ZY7q5wTAmtmNDHWcakqwbV1khaMMM4rWWhLpBWqZ5WgxQHd_2F3uW5eLreWrfuV7HbJ4gebKUz3</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class</title><source>arXiv.org</source><creator>Chambers, Erin Wolf ; Parsa, Salman ; Schreiber, Hannah</creator><creatorcontrib>Chambers, Erin Wolf ; Parsa, Salman ; Schreiber, Hannah</creatorcontrib><description>Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a representative in that homology class which is optimal. We study two measures of optimality, namely, the lexicographic order of cycles (the lex-optimal cycle) and the bottleneck norm (a bottleneck-optimal cycle). We give a simple algorithm for computing the lex-optimal cycle for a 1-homology lass in a closed orientable surface. In contrast to this, our main result is that, in the case of 3-Manifolds of size $n^2$ in the Euclidean 3-space, the problem of finding a bottleneck optimal cycle cannot be solved more efficiently than solving a system of linear equations with an $n \times n$ sparse matrix. From this reduction, we deduce several hardness results. Most notably, we show that for 3-manifolds given as a subset of the 3-space of size $n^2$, persistent homology computations are at least as hard as rank computation (for sparse matrices) while ordinary homology computations can be done in $O(n^2 \log n)$ time. This is the first such distinction between these two computations. Moreover, it follows that the same disparity exists between the height persistent homology computation and general sub-level set persistent homology computation for simplicial complexes in the 3-space.</description><identifier>DOI: 10.48550/arxiv.2112.02380</identifier><language>eng</language><subject>Computer Science - Computational Complexity ; Computer Science - Computational Geometry</subject><creationdate>2021-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2112.02380$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2112.02380$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chambers, Erin Wolf</creatorcontrib><creatorcontrib>Parsa, Salman</creatorcontrib><creatorcontrib>Schreiber, Hannah</creatorcontrib><title>On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class</title><description>Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a representative in that homology class which is optimal. We study two measures of optimality, namely, the lexicographic order of cycles (the lex-optimal cycle) and the bottleneck norm (a bottleneck-optimal cycle). We give a simple algorithm for computing the lex-optimal cycle for a 1-homology lass in a closed orientable surface. In contrast to this, our main result is that, in the case of 3-Manifolds of size $n^2$ in the Euclidean 3-space, the problem of finding a bottleneck optimal cycle cannot be solved more efficiently than solving a system of linear equations with an $n \times n$ sparse matrix. From this reduction, we deduce several hardness results. Most notably, we show that for 3-manifolds given as a subset of the 3-space of size $n^2$, persistent homology computations are at least as hard as rank computation (for sparse matrices) while ordinary homology computations can be done in $O(n^2 \log n)$ time. This is the first such distinction between these two computations. Moreover, it follows that the same disparity exists between the height persistent homology computation and general sub-level set persistent homology computation for simplicial complexes in the 3-space.</description><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Computational Geometry</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OhDAYRbtxYUYfwJXfC4BtaUtZKlHHhITNrNyQ_oGNhRKoZnh7R3R1c5Obk3sQuiM4Z5Jz_KCWs__OKSE0x7SQ-Bq9txPUcZyDO_u0Qez39pX8NMBTTCm4yZlPUJOF5jIxcVjU_OENtHPyowpQbya4FfwECo5xjCEOG9RBresNuupVWN3tfx7Q6eX5VB-zpn19qx-bTIkSZ6zEVLCSCcy10ZY7q5wTAmtmNDHWcakqwbV1khaMMM4rWWhLpBWqZ5WgxQHd_2F3uW5eLreWrfuV7HbJ4gebKUz3</recordid><startdate>20211204</startdate><enddate>20211204</enddate><creator>Chambers, Erin Wolf</creator><creator>Parsa, Salman</creator><creator>Schreiber, Hannah</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20211204</creationdate><title>On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class</title><author>Chambers, Erin Wolf ; Parsa, Salman ; Schreiber, Hannah</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-47026474605bcbd5edaee660b4cb1cde58a965bde82341455983bd18d6af49623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Computational Geometry</topic><toplevel>online_resources</toplevel><creatorcontrib>Chambers, Erin Wolf</creatorcontrib><creatorcontrib>Parsa, Salman</creatorcontrib><creatorcontrib>Schreiber, Hannah</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chambers, Erin Wolf</au><au>Parsa, Salman</au><au>Schreiber, Hannah</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class</atitle><date>2021-12-04</date><risdate>2021</risdate><abstract>Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a representative in that homology class which is optimal. We study two measures of optimality, namely, the lexicographic order of cycles (the lex-optimal cycle) and the bottleneck norm (a bottleneck-optimal cycle). We give a simple algorithm for computing the lex-optimal cycle for a 1-homology lass in a closed orientable surface. In contrast to this, our main result is that, in the case of 3-Manifolds of size $n^2$ in the Euclidean 3-space, the problem of finding a bottleneck optimal cycle cannot be solved more efficiently than solving a system of linear equations with an $n \times n$ sparse matrix. From this reduction, we deduce several hardness results. Most notably, we show that for 3-manifolds given as a subset of the 3-space of size $n^2$, persistent homology computations are at least as hard as rank computation (for sparse matrices) while ordinary homology computations can be done in $O(n^2 \log n)$ time. This is the first such distinction between these two computations. Moreover, it follows that the same disparity exists between the height persistent homology computation and general sub-level set persistent homology computation for simplicial complexes in the 3-space.</abstract><doi>10.48550/arxiv.2112.02380</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2112.02380
ispartof
issn
language eng
recordid cdi_arxiv_primary_2112_02380
source arXiv.org
subjects Computer Science - Computational Complexity
Computer Science - Computational Geometry
title On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T17%3A54%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Complexity%20of%20Computing%20Bottleneck%20and%20Lexicographic%20Optimal%20Cycles%20in%20a%20Homology%20Class&rft.au=Chambers,%20Erin%20Wolf&rft.date=2021-12-04&rft_id=info:doi/10.48550/arxiv.2112.02380&rft_dat=%3Carxiv_GOX%3E2112_02380%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true