Accession Number : AD0689375

Title :   ON THE ENUMERATION OF CONVEX POLYTOPES AND COMBINATORIAL SPHERES.

Descriptive Note : Technical rept.,

Corporate Author : WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS

Personal Author(s) : Grunbaum,Branko

Report Date : MAY 1969

Pagination or Media Count : 41

Abstract : Combinatorial n-spheres and simplicial complexes are equivalent by stellar subdivisions to the boundary of the (n+1) -simplex. Best known examples are the boundary complexes of simplicial (n+1)-polytopes. Despite the obvious relevance of combinatorial n-spheres for topology, for polytopes, for various combinatorial problems, etc., very little is known about them from a combinatorial point of view. The first step in this direction are carried out and lead to some surprising results and to many interesting problems (such as the conjecture that no algorithm inumerates all combinatorial n-spheres). (Author)

Descriptors :   (*GEOMETRY, COMBINATORIAL ANALYSIS), (*TOPOLOGY, COMBINATORIAL ANALYSIS), CONVEX SETS, GRAPHICS, SPHERES, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE