Persistent Combinatorial Model of the Restricted Second Configuration Space of Metric Star Graphs

Abstract

In this work, we present explicit constructions and computations of representative cycles for a nontrivial 2-parameter persistence module arising from the configuration space of metric star graphs. For all edge-length vector L=(L1, L2, …, Lk)∈(R>0)k, we construct a bipartite weighted graph (Gk)L and define filtering functions on the set of vertices and set of edges of (Gk)L to obtain a filtration (denoted by (Gk)-,L) consisting of geometric realization of subgraphs of (Gk)L. We show that such a filtration is naturally isomorphic to the filtration of the restricted second configuration space of metric star graphs (Stark)2r,L concerning the restraint parameter r and an (arbitrary but fixed) edge-length vector L. Additionally, we show that the filtration (Gk)-,L is compatible with the edge-length vector L up to isotopy, establishing an equivalence between the associated (k+1)-parameter persistence modules PHi((Stark)2-,-;F) and PHi((Gk)-,-;F). We call the (multi-)filtration (Gk)-,- a persistent combinatorial model of the multifiltration (Stark)2-,-. Using this model, we construct explicit compatible cycle representatives for PH1((Stark)2-,-;F) in the bifiltration obtained by fixing L2, …, Lk > 0 and varying only r and L1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…