Papers › A computational framework for weighted simplicial homology
A computational framework for weighted simplicial homology
Andrei C. Bura, Neelav S. Dutta, Thomas J. X. Li, Christian M. Reidys
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring R=𝔽[[π]]. This is achieved by starting from a basis for classical homology of the n-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 R. Using the latter, a bijection is established between n+1 and n 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 R. We present algorithms that subsume the torsion computation by reducing it to normalization over the residue field of R, and describe a Python package we implemented that takes advantage of this reduction and performs the computation efficiently.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections