Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Generalized Heawood Inequalities for Manifolds: a van Kampen--Flores-type Nonembeddability Result

Published 28 Oct 2016 in math.CO | (1610.09063v1)

Abstract: The fact that the complete graph K5K_5 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 KnK_n embeds in a closed surface MM (other than the Klein bottle) if and only if (n−3)(n−4)≤6b1(M)(n-3)(n-4)\leq 6b_1(M), where b1(M)b_1(M) is the first Z2\mathbb Z_2-Betti number of MM. On the other hand, van Kampen and Flores proved that the kk-skeleton of the nn-dimensional simplex (the higher-dimensional analogue of Kn+1K_{n+1}) embeds in R<sup>2k\mathbb R<sup>{2k} if and only if~n≤2k+1n \le 2k+1. Two decades ago, K\"uhnel conjectured that the kk-skeleton of the nn-simplex embeds in a compact, (k−1)(k-1)-connected $2k$-manifold with kkth Z2\mathbb Z_2-Betti number bkb_k only if the following generalized Heawood inequality holds: (n−k−1k+1)≤(2k+1k+1)bk\binom{n-k-1}{k+1} \le \binom{2k+1}{k+1}b_k. This is a common generalization of the case of graphs on surfaces as well as the van Kampen--Flores theorem (the special cases k=1k=1 and bk=0b_k=0, respectively), and also closely related to the theory of face numbers of triangulated manifolds. In the spirit of K\"uhnel's conjecture, we prove that if the kk-skeleton of the nn-simplex embeds in a $2k$-manifold with kkth Z2\mathbb Z_2-Betti number bkb_k, then n≤2bk(2k+2k)+2k+4n \le 2b_k\binom{2k+2}{k} + 2k + 4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that MM is (k−1)(k-1)-connected. Our results generalize to maps without qq-covered points, in the spirit of Tverberg's theorem, for qq a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.

Citations (7)

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.