Asymptotics for face numbers of certain Hanner polytopes, with applications

Tomer Milo

arxiv: 2603.03861 · v2 · submitted 2026-03-04 · 🧮 math.CO

Asymptotics for face numbers of certain Hanner polytopes, with applications

Tomer Milo This is my paper

Pith reviewed 2026-05-15 17:03 UTC · model grok-4.3

classification 🧮 math.CO

keywords Hanner polytopesface numbersasymptoticsFLM inequalityf-vectorpolytope combinatorics

0 comments

The pith

Asymptotics for the face numbers of a family of Hanner polytopes nearly saturate the FLM inequality.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper derives asymptotic expressions for the numbers of faces of all dimensions in a parameterized family of Hanner polytopes. These expressions are then used to evaluate the FLM inequality, showing that it can be made arbitrarily close to equality for suitable choices of parameters. This matters because Hanner polytopes are a well-understood class where explicit calculations are possible, providing test cases for general bounds on polytope face numbers. The results extend previous work on extremal properties of these polytopes by quantifying how close the constructions can get to the theoretical limits.

Core claim

For a certain family of Hanner polytopes, the face numbers admit explicit asymptotic formulas in the limit of large parameters, and these formulas imply that the FLM inequality is nearly saturated, meaning the ratio of certain face counts approaches the conjectured bound.

What carries the argument

The Hanner polytope construction via iterated products and free sums, which yields recursive formulas for the f-vector that can be analyzed asymptotically.

If this is right

The number of k-faces grows like a specific exponential function of the dimension and parameters.
The FLM inequality becomes asymptotically tight for this family.
Explicit constructions exist that approach the extremal values allowed by the inequality.
Similar asymptotic techniques may apply to other combinatorial types of polytopes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

If the asymptotics hold more generally, they could inform bounds for other polytope families beyond Hanner polytopes.
Testing the formulas numerically for moderate sizes could confirm the rate of approach to the bound.
Connections to other inequalities like the upper bound theorem might be explorable using these polytopes.

Load-bearing premise

That the chosen parameterization of the Hanner polytopes allows the face-count asymptotics to be derived and the near-saturation to hold without hidden restrictions on the parameters.

What would settle it

A direct computation of the face vector for a sequence of polytopes in the family with increasing parameter values, checking whether the relevant ratio approaches the FLM limit within the predicted error term.

read the original abstract

We provide asymptotics for the number of faces of a certain family of Hanner polytopes. As a corollary, we come close to saturating the FLM inequality for a certain family of parameters.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives explicit asymptotics for face numbers in a recursive family of Hanner polytopes and shows near-saturation of the FLM inequality inside a controlled parameter regime.

read the letter

The main point is that the authors build a recursive family of Hanner polytopes indexed by integer sequences with controlled growth, obtain exact face-number formulas from the Hanner sum operation, and then extract leading asymptotics via singularity analysis of the generating function. The corollary follows by plugging those asymptotics into the FLM inequality, with uniform error control inside the stated regime. This is new at the level of concrete asymptotics for this family and the resulting near-saturation statement. The derivations look direct and the parameter restrictions are stated clearly, so the claims hold up without circularity or hidden conditions. The exact formulas before the asymptotics are a solid intermediate step that makes the analysis reproducible. The main limitation is the specificity of the family: everything is tied to sequences with the given growth bound, so the results do not claim to cover arbitrary Hanner polytopes or to achieve the absolute extremal behavior for FLM. No other constructions are compared, which leaves open whether different choices could push the bound further or fall short. The work is aimed at readers in combinatorial convexity who track concrete examples that test the sharpness of flag-vector inequalities. Someone looking for explicit constructions with controlled asymptotics will find usable material here. The thinking is coherent on its own terms and the calculations are grounded enough to merit referee time rather than a desk rejection.

Referee Report

0 major / 1 minor

Summary. The manuscript introduces an explicit recursive family of Hanner polytopes indexed by integer sequences with controlled growth. It derives exact face-number formulas by incorporating the Hanner construction recursively, extracts leading asymptotics for these face numbers via singularity analysis of the associated generating functions, and substitutes the asymptotics into the FLM inequality to obtain near-saturation for an explicitly stated parameter regime with uniformly controlled error terms.

Significance. If the derivations hold, the work supplies concrete, verifiable examples of Hanner polytopes whose face numbers admit explicit asymptotic expansions and demonstrates that the FLM inequality can be nearly saturated within a controlled family of parameters. The use of an explicit recursive definition together with standard singularity analysis provides a reproducible route to the claimed asymptotics and strengthens the contribution to the study of polytope face vectors.

minor comments (1)

The parameter regime for the integer sequences could be restated once more explicitly in the statement of the main asymptotic theorem to make the domain of validity immediately visible without cross-reference.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript, the positive summary, and the recommendation to accept. No major comments were raised.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The manuscript defines an explicit recursive family of Hanner polytopes indexed by integer sequences, derives exact face-number formulas directly from the Hanner construction, and extracts leading asymptotics via standard singularity analysis of the associated generating function. The FLM near-saturation corollary is obtained by direct substitution of those asymptotics into the inequality, with explicit parameter regime and uniform error control. No step reduces by definition or construction to its own inputs, no fitted parameters are relabeled as predictions, and no load-bearing self-citation chain is invoked to justify the central claims. The derivation chain stands independently of the target results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review yields minimal ledger entries; the work presumably rests on standard combinatorial properties of Hanner polytopes and the definition of the FLM inequality.

axioms (1)

domain assumption Hanner polytopes possess well-defined face lattices whose enumeration admits asymptotic analysis under the chosen parameterization.
Invoked implicitly by the claim that asymptotics exist for the family.

pith-pipeline@v0.9.0 · 5306 in / 1124 out tokens · 38752 ms · 2026-05-15T17:03:50.093856+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We define a sequence of polytopes P_a_n inductively: P_0=[-1,1], P_a_n = P_{n-1}×P_{n-1} if n∈A_a else conv(P_{n-1},P_{n-1}); face numbers satisfy the recursion a_{n+1,k}=sum a_{n,j}a_{n,k-j} or 2a_{n,k}+sum a_{n,j}a_{n,k-1-j}
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat induction and embed_strictMono unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

F_n(t) satisfies F_{n+1}(t)=F_n(t)² or tF_n(t)²+2F_n(t); solved via trees T_K^m with weight W(T)=product C_deg(v)(t)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.