Hanner Polytopes in Convex Geometry

• Hanner polytopes are centrally symmetric convex polytopes recursively constructed from [-1,1] using Cartesian products and direct sums, exhibiting the minimal face count of 3^d.
• They feature self-duality, unconditionality, and a recursive face lattice structure that underpins combinatorial and geometric analyses.
• Hanner polytopes minimize the Mahler volume product and link extremal convex geometry with symplectic properties and billiard dynamics.

A Hanner polytope is a centrally symmetric convex polytope in $\mathbb{R}^d$ constructed recursively from the segment $[-1,1]$ using two fundamental operations: the Cartesian product and a direct-sum (or join) operation that interchanges with polarity. This class plays a central role in the extremal geometry of convex bodies, saturating several conjectured bounds—including Mahler’s volume product minimality and the minimal face-count ($3^d$) among centrally symmetric polytopes. Hanner polytopes underpin key themes in asymptotic convex geometry, combinatorics, and symplectic geometry.

1. Recursive Definition and Equivalent Characterizations

Let $K \subset \mathbb{R}^k$ and $L \subset \mathbb{R}^l$ be centrally symmetric convex bodies. One defines two direct sums in $\mathbb{R}^{k+l}$:

• The $\ell_1$-sum ($K \oplus_1 L$): unit ball of the norm $$\Vert (x,y)\Vert_{K\oplus_1L} = \Vert x\Vert_K + \Vert y\Vert_L$$, i.e.,

$$K\oplus_1L = \{(x,y)\in \mathbb{R}^k\times\mathbb{R}^l : \Vert x\Vert_K + \Vert y\Vert_L \le 1\}$$

• The $[-1,1]$0-sum ($[-1,1]$1): unit ball of the norm $[-1,1]$2, i.e.,

$[-1,1]$3

Recursive construction:

• Base case: $[-1,1]$4, $[-1,1]$5
• Inductive step: if $[-1,1]$6 and $[-1,1]$7 are Hanner polytopes, then both $[-1,1]$8 and $[-1,1]$9 are Hanner polytopes in $3^d$0.

Equivalently, a Hanner polytope in $3^d$1 is any 0-symmetric polytope obtained from $3^d$2 by a finite sequence of Cartesian products and (dually) convex hull sums, or by closing under products and polarity (Balitskiy, 2014, Sanyal et al., 2023). The cube and cross-polytope represent extremal cases in this class.

2. Structural and Geometric Properties

Hanner polytopes exhibit several structural features:

• Self-Duality: The polar of a Hanner polytope is again a Hanner polytope, with $3^d$3, $3^d$4 (Balitskiy, 2014).
• Central Symmetry and Unconditionality: Every Hanner polytope, and each of its faces, is centrally symmetric. In coordinate presentations, Hanner polytopes are unconditional—i.e., invariant under reflection in any coordinate hyperplane (Sanyal et al., 2023).
• Product Structure of Face Lattice: The nonempty faces of a product $3^d$5 are direct products of faces, while those of a sum (join) $3^d$6 are joins of faces. The face lattice is recursively generated, forming a distributive, relatively complemented lattice generalizing the Boolean lattice of the cube (Sanyal et al., 2023).
• Facet Structure: Facets of $3^d$7 are either $3^d$8 or $3^d$9; facets of $K \subset \mathbb{R}^k$0 are $K \subset \mathbb{R}^k$1 (Balitskiy, 2014).
• Graph-Theoretic Characterization: In combinatorial settings, Hanner polytopes can be identified with perfect graphs having no induced 4-vertex paths (cographs), and explicit bijections are established in certain locally anti-blocking or Hansen polytope constructions (Freij et al., 2012, Chor, 29 Jul 2025).

3. Combinatorics: Face Numbers, Flags, and Extremality Results

Hanner polytopes play a central role in minimal face-number phenomena:

• Kalai’s $K \subset \mathbb{R}^k$2 Conjecture: Every centrally symmetric $K \subset \mathbb{R}^k$3-polytope has at least $K \subset \mathbb{R}^k$4 faces; this minimal value is realized exactly by Hanner polytopes (Sanyal et al., 2023). For Hanner polytopes, the sum $K \subset \mathbb{R}^k$5, where each operation in the recursive construction multiplies the total by 3 (Sanyal et al., 2023). Individual face numbers vary (e.g., cube vs cross-polytope), but the total is always $K \subset \mathbb{R}^k$6.
• Flag-face Inequality and Full-Flag Count: For locally anti-blocking centrally symmetric polytopes, the number of full face-flags satisfies $K \subset \mathbb{R}^k$7, with equality only for (generalized) Hanner polytopes (Chor, 29 Jul 2025).
• Explicit Formulas: For the $K \subset \mathbb{R}^k$8-cube, $K \subset \mathbb{R}^k$9; for the cross-polytope, $L \subset \mathbb{R}^l$0 (Chor, 29 Jul 2025, Milo, 4 Mar 2026).
• Extremality in Hansen Polytopes: Among Hansen polytopes (twisted prisms of stable set polytopes of split graphs), the Hanner polytopes are precisely those associated to threshold graphs, and have $L \subset \mathbb{R}^l$1 faces, saturating Kalai’s conjecture (Freij et al., 2012).

4. Mahler’s Conjecture and Volume Product Minimality

Hanner polytopes are tightly connected to Mahler’s conjecture regarding the minimal volume product of centrally symmetric convex bodies:

• Volume Product Formula: For $L \subset \mathbb{R}^l$2 a Hanner polytope in $L \subset \mathbb{R}^l$3, the product $L \subset \mathbb{R}^l$4, which matches that of the $L \subset \mathbb{R}^l$5-cube and $L \subset \mathbb{R}^l$6-cross-polytope (Balitskiy, 2014, Kim, 2012).
• Global and Local Minimality: Every Hanner polytope attains the conjectured minimum of the Mahler product among symmetric convex bodies. Moreover, Hanner polytopes are strict local minimizers for the volume product in the Banach–Mazur topology: if a symmetric convex body is sufficiently close to a Hanner polytope, its volume product exceeds that of the Hanner polytope by a uniform margin (Kim, 2012).
• Combinatorial and Dynamical Evidence: The structural features and billiard-dynamical sharpness (discussed below) further underpin their uniqueness as extremal cases for the volume product.

5. Closed Billiard Trajectories, Symplectic Geometry, and Equality Cases

A profound connection between Hanner polytopes and symplectic/integrable geometry emerges via billiard dynamics:

• Shortest Closed Billiard Trajectories: In the geometry defined by a Hanner polytope $L \subset \mathbb{R}^l$7 and its polar, the shortest classical billiard orbit in $L \subset \mathbb{R}^l$8 with $L \subset \mathbb{R}^l$9-reflection law is always a centrally symmetric $\mathbb{R}^{k+l}$0-periodic path of length 4 (with $\mathbb{R}^{k+l}$1) (Balitskiy, 2014).
• Symplectic Capacity: The length of the shortest closed trajectory equals the Hofer–Zehnder capacity $\mathbb{R}^{k+l}$2. This is precisely matched to the minimal Mahler volume product, reflecting an equivalence between dynamical and mixed-volume extremality (Balitskiy, 2014).
• Viterbo’s and Mahler’s Inequalities: These dynamical and volumetric properties demonstrate that Hanner polytopes are the unique cases realizing equality in both conjectures. This provides a symplectic-geometric proof strategy for identifying extremals.

6. Asymptotics, Applications, and Further Examples

Recent work extends the combinatorial investigations to asymptotic dimensions and functional bounds:

• Asymptotic Growth of Face Numbers: Certain parametric families $\mathbb{R}^{k+l}$3 of Hanner polytopes interpolate between the cube and cross-polytope. For dimension $\mathbb{R}^{k+l}$4 and $\mathbb{R}^{k+l}$5, the exponential growth rate of the number of $\mathbb{R}^{k+l}$6-faces satisfies

$\mathbb{R}^{k+l}$7

for rational $\mathbb{R}^{k+l}$8, with analogous bounds for irrational $\mathbb{R}^{k+l}$9 (Milo, 4 Mar 2026).

• Saturation of Functional Inequalities: Sections of Hanner polytopes nearly saturate the Figiel–Lindenstrauss–Milman (FLM) inequality for choices of parameters governing the relationship of face numbers, facet numbers, and geometric ratios (Milo, 4 Mar 2026).
• Explicit Cases: The construction includes all standard centrally symmetric polytopes as special cases, with the $\ell_1$0-cube and $\ell_1$1-cross-polytope providing combinatorially extreme ends of the family (Sanyal et al., 2023, Milo, 4 Mar 2026).

7. Open Problems and Perspectives

Hanner polytopes serve as test cases for several outstanding conjectures and structural questions:

• Universality of $\ell_1$2 Bound and Flag-Minimality: Kalai’s $\ell_1$3 conjecture and its strengthened flag-variant predict that all centrally symmetric polytopes have at least as many faces (or flags) as a Hanner polytope in the same dimension, with equality only for Hanner polytopes. Full proofs remain open in generality (Sanyal et al., 2023, Chor, 29 Jul 2025).
• Classification of Extremals and Stability: The precise extent to which proximity to the Hanner class is necessary for (near-)minimal face counts, and what polytopes lie strictly above the $\ell_1$4 threshold, remain active research directions (Kim, 2012).
• Combinatorial Realizations and Generalized Constructions: Alternative combinatorial and graph-theoretic characterizations, including cograph representation and connection to threshold and split graphs, illuminate the structure of Hanner polytopes within broader polytope families (Freij et al., 2012, Chor, 29 Jul 2025).

The centrality of Hanner polytopes in the intersection of convex, discrete, and symplectic geometry continues to motivate further investigations into extremal and stability phenomena in high-dimensional convex analysis.