2000 character limit reached
A short exposition of the Patak-Tancer theorem on non-embeddability of $k$-complexes in $2k$-manifolds (2106.14010v3)
Published 26 Jun 2021 in math.GT and cs.DM
Abstract: In 2019 P. Patak and M. Tancer obtained the following higher-dimensional generalization of the Heawood inequality on embeddings of graphs into surfaces. We expose this result in a short well-structured way accessible to non-specialists in the field. Let $\Delta_nk$ be the union of $k$-dimensional faces of the $n$-dimensional simplex. Theorem. (a) If $\Delta_nk$ PL embeds into the connected sum of $g$ copies of the Cartesian product $Sk\times Sk$ of two $k$-dimensional spheres, then $g\ge\dfrac{n-2k-1}{k+2}$. (b) If $\Delta_nk$ PL embeds into a closed $(k-1)$-connected PL $2k$-manifold $M$, then $(-1)k(\chi(M)-2)\ge\dfrac{n-2k-1}{k+1}$.