Algorithmic canonical stratifications of simplicial complexes
Ryo Asai, Jay Shah

TL;DR
This paper presents a new algorithm for stratifying finite simplicial complexes based on local homology, enabling canonical stratified homotopy type computation with proven correctness and polynomial runtime for low dimensions.
Contribution
The paper introduces a novel algorithm for canonical stratification of simplicial complexes using local homology, with theoretical validation and efficient implementation for dimensions up to three.
Findings
Algorithm correctly computes canonical stratification.
Runs in polynomial time for dimensions ≤ 3.
Experimental results confirm linear runtime on Delaunay triangulations.
Abstract
We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification of the poset of simplices of a simplicial complex , such that for each strata , is maximal among all open subposets in its closure such that the restriction of the local -homology sheaf of to is locally constant. Passage to the localization of dictated by then attaches a canonical stratified homotopy type to . Using -categorical methods, we first prove that the proposed algorithm correctly computes the canonical stratification of a simplicial complex; along the way, we prove a few general results about sheaves on posets and the homotopy types of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Commutative Algebra and Its Applications
