The flag upper bound theorem for 3- and 5-manifolds

TL;DR

This paper establishes the maximum face numbers for flag 3- and 5-manifolds, proving a conjecture for 3-manifolds and providing bounds and characterizations for 5-manifolds, advancing understanding of their combinatorial structure.

Contribution

It proves the flag upper bound conjecture for 3-manifolds and provides sharp bounds and characterizations for 5-manifolds, extending the results to Eulerian complexes.

Findings

Join of two circles maximizes face numbers among flag 3-manifolds.

Sharp upper bound on edges of flag 5-manifolds with equality cases.

Flag upper bound inequality holds for all flag 3-dimensional Eulerian complexes.

Abstract

We prove that among all flag 3-manifolds on $n$ vertices, the join of two circles with $\left\lceil{\frac{n}{2}}\right \rceil$ and $\left\lfloor{\frac{n}{2}}\right \rfloor$ vertices respectively is the unique maximizer of the face numbers. This solves the first case of a conjecture due to Lutz and Nevo. Further, we establish a sharp upper bound on the number of edges of flag 5-manifolds and characterize the cases of equality. We also show that the inequality part of the flag upper bound conjecture continues to hold for all flag 3-dimensional Eulerian complexes and find all maximizers of the face numbers in this class.