ON THE ENUMERATION OF CONVEX POLYTOPES AND COMBINATORIAL SPHERES.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1969
- Accession Number
- AD0689375
Entities
People
- Branko Grunbaum
Organizations
- University of Washington