2000 character limit reached
$P$-persistent homology of finite topological spaces
Published 17 Feb 2015 in math.AT, cs.CG, math.CO, and math.CT | (1502.04873v1)
Abstract: Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
