AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as covers for the convex polyhedral prisms and antiprisms. It includes a detailed discussion of their topological structure, and completes the enumeration of such covers for convex uniform polyhedra. Additionally, this paper addresses related structural questions in the theory of string C-groups
A system of linear inequality and equality constraints determines a convex polyhedral set of feasibl...
Complex groups generated by involutory reflexions arise naturally in the modern theory of abstract r...
A clutter L is a collection of subsets of a ground set E(L) with the property that, for every pair A...
polytopes that act as covers for the convex polyhedral prisms and antiprisms. It includes a detailed...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
AbstractThe mixing operation for abstract polytopes gives a natural way to construct a minimal commo...
AbstractIn the classical setting, a convex polytope is said to be semiregular if its facets are regu...
A polygonal cover of a finite collection of pairwise disjoint convex compact sets in the plane is a ...
AbstractLet P be a compact connected polyhedron. A categorical (contractible) cover {X1,…,Xk} of P i...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
There are only finitely many locally projective regular polytopes of type {5, 3, 5}. They are covere...
When the standard representation of a crystallographic Coxeter group Γ is reduced modulo an odd prim...
AbstractComplex groups generated by involutory reflexions arise naturally in the modern theory of ab...
AbstractA theory parallel to that for blocking pairs of polyhedra is developed for anti-blocking pai...
ABSTRACT. Knowing the symmetries of a polyhedron can be very useful for the analysis of its structur...
A system of linear inequality and equality constraints determines a convex polyhedral set of feasibl...
Complex groups generated by involutory reflexions arise naturally in the modern theory of abstract r...
A clutter L is a collection of subsets of a ground set E(L) with the property that, for every pair A...
polytopes that act as covers for the convex polyhedral prisms and antiprisms. It includes a detailed...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
AbstractThe mixing operation for abstract polytopes gives a natural way to construct a minimal commo...
AbstractIn the classical setting, a convex polytope is said to be semiregular if its facets are regu...
A polygonal cover of a finite collection of pairwise disjoint convex compact sets in the plane is a ...
AbstractLet P be a compact connected polyhedron. A categorical (contractible) cover {X1,…,Xk} of P i...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
There are only finitely many locally projective regular polytopes of type {5, 3, 5}. They are covere...
When the standard representation of a crystallographic Coxeter group Γ is reduced modulo an odd prim...
AbstractComplex groups generated by involutory reflexions arise naturally in the modern theory of ab...
AbstractA theory parallel to that for blocking pairs of polyhedra is developed for anti-blocking pai...
ABSTRACT. Knowing the symmetries of a polyhedron can be very useful for the analysis of its structur...
A system of linear inequality and equality constraints determines a convex polyhedral set of feasibl...
Complex groups generated by involutory reflexions arise naturally in the modern theory of abstract r...
A clutter L is a collection of subsets of a ground set E(L) with the property that, for every pair A...
DOI
Add to ORKG