On Generalized Heawood Inequalities for Manifolds: a van Kampen--Flores-type Nonembeddability Result
Xavier Goaoc, and Isaac Mabillard, Pavel Pat\'ak, Zuzana, Pat\'akov\'a, Martin Tancer, Uli Wagner

TL;DR
This paper extends nonembeddability results for simplicial complexes into manifolds, generalizing classical theorems like Heawood and van Kampen--Flores, and provides new bounds related to the embeddability of skeletons of simplices.
Contribution
It proves a new upper bound for the embedding dimension of the $k$-skeleton of an $n$-simplex into $2k$-manifolds, generalizing previous inequalities without requiring $(k-1)$-connectivity.
Findings
Established a new bound: $n \,\le\, 2b_k\binom{2k+2}{k} + 2k + 4$ for embeddings.
Generalized classical nonembeddability theorems to broader classes of manifolds.
Extended results to maps without $q$-covered points, related to Tverberg's theorem.
Abstract
The fact that the complete graph does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph embeds in a closed surface (other than the Klein bottle) if and only if , where is the first -Betti number of . On the other hand, van Kampen and Flores proved that the -skeleton of the -dimensional simplex (the higher-dimensional analogue of ) embeds in if and only if~. Two decades ago, K\"uhnel conjectured that the -skeleton of the -simplex embeds in a compact, -connected -manifold with th -Betti number only if the following generalized Heawood inequality holds: $\binom{n-k-1}{k+1} \le…
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
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Advanced Combinatorial Mathematics
