Search arXivSearch

arXiv · 2311.06870

Grassmannian Persistence Diagrams

Abstract

We introduce Orthogonal Möbius Inversion $\mathsf{OI}$, a concept analogous to Möbius inversion on finite posets, which is applicable to order-preservings functions from a finite poset to the Grassmannian $\mathsf{Gr}(V)$ of an inner product space $V$. This notion critically relies on the inner product structure on $V$ enabling it to capture much finer information than standard integer-valued persistence diagrams. Orthogonal Inversion is a special case of the broader concept of Orthomodular Inversion, where the target space is any orthomodular lattice, which we also identify. We apply Orthogonal Inversion in order to construct a "non-negative" persistence diagram for any given multiparameter filtration $\mathsf{F}$ of a finite simplicial complex $K$, indexed over an arbitrary finite poset $P$. This is done by applying it to the birth-death spaces of $\mathsf{F}$. Analogously to $1$-parameter classical persistence diagrams, these multiparameter Grassmannian persistence diagrams offer straightforward interpretability. Specifically, to a segment $(b, d) \in \mathsf{Seg}(P)$, (1) the Grassmannian persistence diagram canonically assigns a vector subspace of $C_ρ^K$ consisting of cycles that are born at $b$ and become boundaries at $d$ and (2) this assignment is exhaustive at the homology level. Finally, we relate our Grassmannian persistence diagrams to the recently introduced notion of Möbius homology, thus enhancing its interpretability through the lens of our framework.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan. 2025-04-28. Grassmannian Persistence Diagrams. https://arxiv.org/abs/2311.06870

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO