We propose algorithms based on monomial resolution theory for simplicial homology computation. We explore some alternatives that can either be used as a preprocessing step for homology computation or as alternatives to the usual linear algebra approach. We show the results of some computer experiments to demonstrate the performance of a C++ implementation using the computer algebra library CoCoALib.
Monomial resolutions for efficient computation of simplicial homology
Bigatti A. M.;
2019-01-01
Abstract
We propose algorithms based on monomial resolution theory for simplicial homology computation. We explore some alternatives that can either be used as a preprocessing step for homology computation or as alternatives to the usual linear algebra approach. We show the results of some computer experiments to demonstrate the performance of a C++ implementation using the computer algebra library CoCoALib.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
BHS19-final.pdf
accesso chiuso
Descrizione: Articolo principale
Tipologia:
Documento in versione editoriale
Dimensione
781.41 kB
Formato
Adobe PDF
|
781.41 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
