Papers βΊ On the additive image of 0th persistent homology
On the additive image of 0th persistent homology
Ulrich Bauer, Magnus Bakke Botnan, Steffen Oppermann, Johan Steen
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.
For X a finite category and F a finite field, we study the additive image of the functor Hβ(-,F) rep(X, ππ¨π©) βrep(X, ππππ_F), or equivalently, of the free functor rep(X, πππ) βrep(X, ππππ_F). We characterize all finite categories X for which the indecomposables in the additive image coincide with the indecomposable indicator representations and provide examples of quivers of wild representation type where the additive image contains only finitely many indecomposables. Motivated by questions in topological data analysis, we conduct a detailed analysis of the additive image for finite grids. In particular, we show that for grids of infinite representation type, there exist infinitely many indecomposables both within and outside the additive image. We develop an algorithm for determining if a representation of a finite category is in the additive image. In addition, we investigate conditions for realizability and the effect of modifications of the source category and the underlying field. The paper concludes with a discussion of the additive image of Hβ(-,F) for an arbitrary field F, extending previous work for prime fields.
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