Intrinsic linking of a simplicial $n$-complex embedded in $\mathbb{R}^{2n}$
Ryo Nikkuni

TL;DR
This paper proves that certain minimal simplicial complexes in 2n-dimensional space always contain a non-splittable link, extending classical graph embedding results to higher dimensions.
Contribution
It establishes the intrinsic linking property of minimal simplicial n-complexes in ra8^{2n}a8, generalizing known planar graph non-separability results.
Findings
Existence of unavoidable linked pairs in embedded complexes
Generalization of planar graph non-separability to higher dimensions
Intrinsic linking is inherent in minimal simplicial complexes
Abstract
We demonstrate the existence of minimal simplicial -complexes which inevitably contain a nonsplittable two-component link formed by an -sphere and an -sphere in any embedding into . This provides a higher-dimensional generalization of graphs that are not non-separating planar.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis
