4 citations · 6 across the 5 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.AT2025
Fast free resolutions of bifiltered chain complexes
Ulrich Bauer, Tamal K. Dey, Michael Kerber +2
In a -critical bifiltration, every simplex enters along a staircase with at most steps. Examples with include degree-Rips bifiltrations and models of the multicover bi…
math.AT2025
Computing Projective Implicit Representations from Poset Towers
Tamal K. Dey, Florian Russold
A family of simplicial complexes connected by simplicial maps and indexed by a finite poset is called a poset tower. Poset towers subsume multi-parameter filtrations, zigzag fi…
math.AT2025★ 1 cited
Representing two-parameter persistence modules via graphcodes
Michael Kerber, Florian Russold
Graphcodes were recently introduced as a technique to employ two-parameter persistence modules in machine learning tasks (Kerber and Russold, NeurIPS 2024). We show in this work th…