Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.42090

Landscape Intervals: A Geometric Framework for Multiparameter Persistence Landscapes

Pan Fang·Washington Mio·Tom Needham
View original source ↗Read source document ↗Export metadata ↓

Abstract

Classical persistent homology provides a summary of the multiscale topology of a filtration of a space. These summaries are not naturally valued in a vector space, limiting their direct use in standard machine learning pipelines. To address this issue, Bubenik introduced persistence landscapes, vector-valued invariants of persistence modules, which operate by conveniently encoding the behavior of rank functions of modules along the parameter axis. When passing to multiparameter persistent homology, changes in the rank functions vary by different amounts in different directions. In this paper, we introduce the landscape interval, a subset of the parameter space of a multiparameter persistence module which records changes in the rank function in all directions simultaneously. This geometric perspective leads to two novel invariants which serve as notions of persistence landscapes for multiparameter modules. We show that our invariants generalize existing landscape-type invariants: in particular, they recover Bubenik's landscapes in the one-parameter setting and allow us to obtain the multiparameter landscapes introduced by Vipond. For our main theoretical contributions, we establish two exact identities connecting landscapes with erosion distances, prove that our invariants are stable under perturbations, and refine the interleaving-stability bounds for the existing landscape-type invariants. We also show that on a certain class of multiparameter persistence modules, the full invariants can be recovered from finite information about the module. On the practical side, we introduce a robust numerical framework for extracting our invariants from real data and for incorporating them into standard machine learning pipelines. The framework is illustrated on surface mesh and medical image data.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pan Fang, Washington Mio, Tom Needham. 2026-10-30. Landscape Intervals: A Geometric Framework for Multiparameter Persistence Landscapes. https://arxiv.org/abs/2610.42090

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adams filtrations and secondary coherence for fibers of Steenrod operations

Motivated by the Bruner--Rognes two-extension theorem and open questions regarding the secondary cohomology modeling of fibers of Steenrod operations, we develop a general framework to compute their Adams filtrations and delineate the underlying algebraic obstructions. Let $f:Y\to\prodΣ^{d_λ}H\mathbb F_2$ be a locally finite family of positive-degree stable operations, where $Y=H\mathbb F_2$ or $H\mathbb Z$. We determine the Adams filtration of its fiber from the minimal generators of $\operatorname{im}(f^*)$ as a left Steenrod module. An explicit target automorphism separates a minimal subfamily, and combining this with the two-extension theorem and an acyclic cancellation gives $E_3=E_\infty$. A terminating Adem recursion realizes this splitting for the full positive even-square family. Separately, we identify two fundamental algebraic obstructions to directly constructing the secondary cohomology of these fibers: an augmentation discrepancy when the primary row has a nonzero kernel, and a coherence obstruction class in the third cohomology of a Hom complex. These results demonstrate why the secondary Ext groups of these fibers must be derived topologically via the Baues--Jibladze comparison theorem, rather than through a direct algebraic resolution.

math.AT↗
arXiv2026

Discrete homotopy groups of cubical sets

We extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, and show that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations. Here, quasisymmetric cubical sets are cubical sets equipped with coordinate permutation symmetries that are compatible with faces and degeneracies, but not necessarily with connections. We give a purely combinatorial construction of the left adjoint of the forgetful functor from the category of quasisymmetric cubical sets to the category of cubical sets, and prove that the unit of this adjunction is a natural weak equivalence. As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets. As an application, we establish the discrete Hurewicz map from the discrete homotopy groups of a cubical set to the homology groups, and prove a Hurewicz theorem with respect to the discrete Hurewicz map whenever the cubical set is quasisymmetric. Applied to the 1-nerve of a directed graph, it also yields a Hurewicz theorem relating the homotopy groups of Li, Wu, Yau, and Zhang to singular cubical homology.

math.AT↗
arXiv2026

Monoidal and symmetrized parametrized topological complexity

We introduce and study monoidal and symmetrized versions of parametrized topological complexity. First, we develop parametrized analogues of the monoidal topological complexity theories of Iwase--Sakai, Aguilar-Guzmán--González (based on the Fadell--Husseini approach), and Dranishnikov. We investigate the parametrized Iwase--Sakai conjecture and provide sufficient conditions under which it holds. We then introduce symmetrized parametrized topological complexity and combine it with the monoidal perspective to define monoidal symmetrized parametrized topological complexity, showing that the resulting notions agree. Finally, we compute these invariants for Fadell--Neuwirth fibrations.

math.AT↗