AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of another, of the same dimension, leads to a fascinating interplay of geometry, combinatorics, and matrix theory, with further relations to number theory and algebraic topology. This mainly expository paper is an account of this subject, its history, and the principal results together with an outline of their proofs. The relationships with other branches of mathematics are also explained
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
Every convex polytope is both the intersection of a finite set of halfspaces and the convex hull of ...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
Consider a finite set whose elements are associated with vectors of common dimension. A partition of...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
Abstract. Motivated by the graph associahedron KG, a polytope whose face poset is based on connected...
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E3 o...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractWe introduce the notion of a convex geometry extending the notion of a finite closure system...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
Every convex polytope is both the intersection of a finite set of halfspaces and the convex hull of ...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
Consider a finite set whose elements are associated with vectors of common dimension. A partition of...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real proj...
AbstractA convex polytope P can be specified in two ways: as the convex hull of the vertex set V of ...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
Abstract. Motivated by the graph associahedron KG, a polytope whose face poset is based on connected...
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E3 o...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractWe introduce the notion of a convex geometry extending the notion of a finite closure system...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
Every convex polytope is both the intersection of a finite set of halfspaces and the convex hull of ...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...