Answers are grounded in this paper and cite their sources.
Theoretical analysis proves irreducible-Ferrers polytopes are combinatorially equivalent to products of triangles, revealing their complete face lattice and facet counts.
For every integer d at least 3, this note proves that the irreducible-Ferrers polytope introduced by Beeloo-Sauerbier Couvée and Neri is combinatorially equivalent to a Cartesian product of d-2 triangles. The proof recovers the complete face lattice from their nonnegative affine-slice model and vertex-support classification. Consequences include simplicity, the exact number of facets, and the complete face enumerator. Status: Public Beta; internally verified candidate proof; external review pending.
No takes yet. Share an insight, caveat, or question.
Carptopus (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: