Mathematika

Table of Contents - December 1963 - Volume 10, Issue 02  

Research Article

Decomposable convex polyhedra

G. C. Shepharda1

a1 University of Birmingham.

By a convex polyhedron P we mean any bounded set which can be written as the intersection of a finite number of closed half-spaces. If P can be written as a vector sum Q+B of convex polyhedra, then Q and B are called summands of P. If P has a summand which is not homothetic to itself, then P is said to be decomposable.

(Received August 12 1963)