Simplicial Perturbation Techniques and Effective Homology
Simplicial Perturbation Techniques and Effective Homology
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary simplicial perturbation” process such as the inclusion or elimination of a maximal simplex or an edge contraction. To this aim we compute an algebraic topological model that is a special chain homotopy equivalence connecting the simplicial complex with its homology (working with a field as the ground ring).
- University of Seville Spain
Algorithm Analysis and Problem Complexity, Math Applications in Computer Science, Discrete Mathematics in Computer Science, Programming Techniques, Algorithms, Symbolic and Algebraic Manipulation
Algorithm Analysis and Problem Complexity, Math Applications in Computer Science, Discrete Mathematics in Computer Science, Programming Techniques, Algorithms, Symbolic and Algebraic Manipulation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!