Papers
Topics
Authors
Recent
Search
2000 character limit reached

Braiding vineyards

Published 15 Apr 2025 in cs.CG, math.AT, and math.GT | (2504.11203v1)

Abstract: Vineyards are a common way to study persistence diagrams of a data set which is changing, as strong stability means that it is possible to pair points in ``nearby'' persistence diagrams, yielding a family of point sets which connect into curves when stacked. Recent work has also studied monodromy in the persistent homology transform, demonstrating some interesting connections between an input shape and monodromy in the persistent homology transform for 0-dimensional homology embedded in R<sup>2\mathbb{R}<sup>2. In this work, we re-characterize monodromy in terms of periodicity of the associated vineyard of persistence diagrams. We construct a family of objects in any dimension which have non-trivial monodromy for ll-persistence of any periodicity and for any ll. More generally we prove that any knot or link can appear as a vineyard for a shape in R<sup>d\mathbb{R}<sup>d, with d≥3d\geq 3. This shows an intriguing and, to the best of our knowledge, previously unknown connection between knots and persistence vineyards. In particular this shows that vineyards are topologically as rich as one could possibly hope.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.