Existence of a small cover over a 15-colorable simple 4-polytope

TL;DR

This paper constructs a 4-dimensional simple polytope with a characteristic map that attains the upper chromatic number bound of 15, confirming the bound's sharpness for n=4 and exploring related cases.

Contribution

It demonstrates the existence of a 4-polytope with a characteristic map reaching the maximum chromatic number, providing new insights into the bounds for simple polytopes.

Findings

Constructed a 4-polytope with chromatic number 15

Confirmed the upper bound is sharp for n=4

Extended results to oriented small covers in dimensions 4 and 5

Abstract

The chromatic number for properly colouring the facets of a combinatorial simple $n$-polytope $P^n$ that is the orbit space of a quasitoric manifold satisfies the inequality $n\leq P^n\leq 2^n-1$. The inequality is sharp for $n=2$ but not for $n=3$ due to the Four Color theorem. In this note, we construct a simple 4-polytope admitting a characteristic map whose chromatic number equals $15$ and deduce that the predicted upper bound is attained for $n=4$. Analogues results are verified for the case of oriented small covers in dimensions $4$ and $5$.