Computing the Homology Functor on Semi-algebraic Maps and Diagrams.

Saved in:
Bibliographic Details
Title: Computing the Homology Functor on Semi-algebraic Maps and Diagrams.
Authors: Basu, Saugata1 (AUTHOR) sbasu@math.purdue.edu, Karisani, Negin2 (AUTHOR)
Source: Discrete & Computational Geometry. Dec2024, Vol. 72 Issue 4, p1437-1462. 26p.
Subjects: Semialgebraic sets, Linear operators, Bar codes, Algorithms, Geometry
Abstract: Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the more general problem of computing the image under the homology functor of a continuous semi-algebraic map f : X → Y between closed and bounded semi-algebraic sets. For every fixed ℓ ≥ 0 we give an algorithm with singly exponential complexity that computes bases of the homology groups H i (X) , H i (Y) (with rational coefficients) and a matrix with respect to these bases of the induced linear maps H i (f) : H i (X) → H i (Y) , 0 ≤ i ≤ ℓ . We generalize this algorithm to more general (zigzag) diagrams of continuous semi-algebraic maps between closed and bounded semi-algebraic sets and give a singly exponential algorithm for computing the homology functors on such diagrams. This allows us to give an algorithm with singly exponential complexity for computing barcodes of semi-algebraic zigzag persistent homology in small dimensions. [ABSTRACT FROM AUTHOR]
Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 180935834
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Computing the Homology Functor on Semi-algebraic Maps and Diagrams.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Basu%2C+Saugata%22">Basu, Saugata</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sbasu@math.purdue.edu</i><br /><searchLink fieldCode="AR" term="%22Karisani%2C+Negin%22">Karisani, Negin</searchLink><relatesTo>2</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+%26+Computational+Geometry%22">Discrete & Computational Geometry</searchLink>. Dec2024, Vol. 72 Issue 4, p1437-1462. 26p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Semialgebraic+sets%22">Semialgebraic sets</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+operators%22">Linear operators</searchLink><br /><searchLink fieldCode="DE" term="%22Bar+codes%22">Bar codes</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Geometry%22">Geometry</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Developing an algorithm for computing the Betti numbers of semi-algebraic sets with singly exponential complexity has been a holy grail in algorithmic semi-algebraic geometry and only partial results are known. In this paper we consider the more general problem of computing the image under the homology functor of a continuous semi-algebraic map f : X → Y between closed and bounded semi-algebraic sets. For every fixed ℓ ≥ 0 we give an algorithm with singly exponential complexity that computes bases of the homology groups H i (X) , H i (Y) (with rational coefficients) and a matrix with respect to these bases of the induced linear maps H i (f) : H i (X) → H i (Y) , 0 ≤ i ≤ ℓ . We generalize this algorithm to more general (zigzag) diagrams of continuous semi-algebraic maps between closed and bounded semi-algebraic sets and give a singly exponential algorithm for computing the homology functors on such diagrams. This allows us to give an algorithm with singly exponential complexity for computing barcodes of semi-algebraic zigzag persistent homology in small dimensions. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=180935834
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00454-024-00627-z
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 1437
    Subjects:
      – SubjectFull: Semialgebraic sets
        Type: general
      – SubjectFull: Linear operators
        Type: general
      – SubjectFull: Bar codes
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Geometry
        Type: general
    Titles:
      – TitleFull: Computing the Homology Functor on Semi-algebraic Maps and Diagrams.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Basu, Saugata
      – PersonEntity:
          Name:
            NameFull: Karisani, Negin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 01795376
          Numbering:
            – Type: volume
              Value: 72
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Discrete & Computational Geometry
              Type: main
ResultId 1