On Monotypic Polytopes

Abstract A convex polytope P is monotypic if every polytope with the same set of outer normal vectors to its facets is isomorphic to P . Such a polytope P is also characterized by the fact that each non-empty intersection of P with a translate is homothetic to a summand of P . A strongly monotypic polytope P is such that the facet normals determine the isomorphism class of the arrangement of the hyperplanes spanned by its facets. It was shown in an earlier paper on the topic that, if P is strongly monotypic, then each non-empty intersection of P with a translate is a summand of P . However, the converse was left open. A proof of this has recently been given by Vuong Bui; however, a striking feature of the alternative proof given here, which as in the original paper uses representations, is that it reduces the problem to the already known 3-dimensional case.

Authors

Institutions

Publication Details

Journal
Discrete & Computational Geometry
Published
2026-01-09
DOI
https://doi.org/10.1007/s00454-025-00810-w
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Monotypic Polytopes

Peter McMullen
Discrete & Computational Geometry
Point processes and geometric inequalities
article

On Monotypic Polytopes

Peter McMullen
article en

Abstract

Abstract A convex polytope P is monotypic if every polytope with the same set of outer normal vectors to its facets is isomorphic to P . Such a polytope P is also characterized by the fact that each non-empty intersection of P with a translate is homothetic to a summand of P . A strongly monotypic polytope P is such that the facet normals determine the isomorphism class of the arrangement of the hyperplanes spanned by its facets. It was shown in an earlier paper on the topic that, if P is strongly monotypic, then each non-empty intersection of P with a translate is a summand of P . However, the converse was left open. A proof of this has recently been given by Vuong Bui; however, a striking feature of the alternative proof given here, which as in the original paper uses representations, is that it reduces the problem to the already known 3-dimensional case.

Discrete & Computational Geometry
University College London (GB)
Openalex Percentile: Top 91%
Point processes and geometric inequalities
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.

On Monotypic Polytopes — Peter McMullen · Discrete & Computational Geometry (2026) | TGRS Research Map | TGRS