English

A computational framework for weighted simplicial homology

Algebraic Topology 2022-06-10 v1 Symbolic Computation Combinatorics General Topology K-Theory and Homology

Abstract

We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring R=F[[π]]R=\mathbb{F}[[\pi]]. This is achieved by starting from a basis for classical homology of the nn-th skeleton for the underlying complex with coefficients in the residue field F\mathbb{F} and then lifting it to a basis for the weighted homology with coefficients in the ring RR. Using the latter, a bijection is established between n+1n+1 and nn dimensional simplices whose weight ratios provide the exponents of the π\pi-monomials that generate each torsion summand in the structure theorem of the weighted homology modules over RR. We present algorithms that subsume the torsion computation by reducing it to normalization over the residue field of RR, 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

R2 v1 2026-06-24T11:45:25.322Z