Computing Persistence Modules on Commutative Ladders of Finite Type
From MaRDI portal
Publication:2879114
DOI10.1007/978-3-662-44199-2_25zbMath1357.68303arXiv1404.7588OpenAlexW2278796013MaRDI QIDQ2879114
Yasuaki Hiraoka, Emerson G. Escolar
Publication date: 8 September 2014
Published in: Mathematical Software – ICMS 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7588
Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Representations of quivers and partially ordered sets (16G20) Abstract complexes in algebraic topology (55U05)
Related Items (4)
Staircase algebras and graded nilpotent pairs ⋮ Acyclic partial matchings for multidimensional persistence: algorithm and combinatorial interpretation ⋮ Persistence modules on commutative ladders of finite type ⋮ Relative interleavings and applications to sensor networks
This page was built for publication: Computing Persistence Modules on Commutative Ladders of Finite Type