In an extension of the classical
Radon theorem, Hare and Kenelly have introduced the concept of a primitive
partition, allowing a reduction to minimal subsets which still possess the necessary
intersection property.
Here it is proved that primitive partitions in the vertex set P of a polytope reveal
the subsets of P which give rise to faces of conv P, thus determining the
combinatorial type of the polytope. Furthermore, the polytope may be reconstructed
from various subcollections of the primitive partitions.
|