New algorithms compute Hom spaces for poset representations in O(n^4 (thick(Y) + thick(Omega^1 Y))^2) time using a uniqueness result for lifts, plus a classical O(n^3 thick(Y)^3) method, both improving on O(n^6) and strengthening AIDA for multiparameter persistence.
Dey, Michael Kerber, Florian Russold, and Matthias Söls.Fast free resolutions of bifiltered chain complexes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing Homomorphisms of Poset Representations with Applications to Multiparameter Persistence
New algorithms compute Hom spaces for poset representations in O(n^4 (thick(Y) + thick(Omega^1 Y))^2) time using a uniqueness result for lifts, plus a classical O(n^3 thick(Y)^3) method, both improving on O(n^6) and strengthening AIDA for multiparameter persistence.