A computational framework for weighted simplicial homology
Abstract
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring . This is achieved by starting from a basis for classical homology of the -th skeleton for the underlying complex with coefficients in the residue field and then lifting it to a basis for the weighted homology with coefficients in the ring . Using the latter, a bijection is established between and dimensional simplices whose weight ratios provide the exponents of the -monomials that generate each torsion summand in the structure theorem of the weighted homology modules over . We present algorithms that subsume the torsion computation by reducing it to normalization over the residue field of , and describe a Python package we implemented that takes advantage of this reduction and performs the computation efficiently.
Keywords
Cite
@article{arxiv.2206.04612,
title = {A computational framework for weighted simplicial homology},
author = {Andrei C. Bura and Neelav S. Dutta and Thomas J. X. Li and Christian M. Reidys},
journal= {arXiv preprint arXiv:2206.04612},
year = {2022}
}
Comments
16 pages, 2 figures