Extending Ziegler's Prism Recurrence Formula: A Closed-Form Expression for Face Enumeration of Prismatic Polytopes

We present a novel closed-form expression for the enumeration of k-dimensional faces in prismatically constructed polytopes formed via repeated Cartesian products with the unit interval. Building upon Ziegler’s classical recurrence relation for face counts under prism operations—namely, 𝑓𝑘(𝑃 × 𝐼) = 2 ⋅ 𝑓𝑘(𝑃) + 𝑓𝑘−1(𝑃) —we derive a binomial convolution formula that unrolls this recurrence over nnn dimensions. The resulting expression computes 𝑓𝑘 directly from the base polytope's face data and bypasses recursive computation. Our formula captures the combinatorial structure of the face lattice of these prismatic polytopes and aligns with the product rules outlined in Grünbaum’s Convex Polytopes. This work contributes a compact and computationally efficient method for face enumeration and offers insight into the algebraic structure underlying iterated polytope products.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-08-18
DOI
https://doi.org/10.5281/zenodo.17141373
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extending Ziegler's Prism Recurrence Formula: A Closed-Form Expression for Face Enumeration of Prismatic Polytopes

Zenodo (CERN European Organization for Nuclear Research)
Geochemistry and Geologic Mapping
article

Extending Ziegler's Prism Recurrence Formula: A Closed-Form Expression for Face Enumeration of Prismatic Polytopes

article en

Abstract

We present a novel closed-form expression for the enumeration of k-dimensional faces in prismatically constructed polytopes formed via repeated Cartesian products with the unit interval. Building upon Ziegler’s classical recurrence relation for face counts under prism operations—namely, 𝑓𝑘(𝑃 × 𝐼) = 2 ⋅ 𝑓𝑘(𝑃) + 𝑓𝑘−1(𝑃) —we derive a binomial convolution formula that unrolls this recurrence over nnn dimensions. The resulting expression computes 𝑓𝑘 directly from the base polytope's face data and bypasses recursive computation. Our formula captures the combinatorial structure of the face lattice of these prismatic polytopes and aligns with the product rules outlined in Grünbaum’s Convex Polytopes. This work contributes a compact and computationally efficient method for face enumeration and offers insight into the algebraic structure underlying iterated polytope products.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 39%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.