ON THE ENUMERATION OF CONVEX POLYTOPES AND COMBINATORIAL SPHERES.
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Pagination or Media Count:
Combinatorial n-spheres and simplicial complexes are equivalent by stellar subdivisions to the boundary of the n1 -simplex. Best known examples are the boundary complexes of simplicial n1-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
- Theoretical Mathematics