AbstractThis paper addresses the problem of finding abstract regular polytopes with preassigned facets and preassigned last entry of the Schläfli symbol. Using C-group permutation representation (CPR) graphs we give a solution to this problem for dually bipartite regular polytopes when the last entry of the Schläfli symbol is even. This construction is related to a previous construction by Schulte that solves the problem when the entry of the Schläfli symbol is 6
In this paper we list all possible degrees of a faithful transitive permutation representation of th...
AbstractThere is a well-known correspondence between abstract regular polytopes and string C-groups....
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractThis paper addresses the problem of finding abstract regular polytopes with preassigned face...
AbstractWe say that a (d+1)-polytope P is an extension of a polytope K if the facets or the vertex f...
AbstractThis paper studies C-group permutation representation graphs, or for short, CPR graphs. C-gr...
We give conditions for oriented labeled graphs that must be satisfied in order that such are permut...
AbstractIn a previous paper we constructed a finite regular (abstract) 4-polytope of type {3,3,p} fo...
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial...
AbstractIn the classical setting, a convex polytope is said to be semiregular if its facets are regu...
Up to isomorphism and duality, there are exactly two nondegener-ate abstract regular polytopes of ra...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
Complex groups generated by involutory reflexions arise naturally in the modern theory of abstract r...
AbstractComplex groups generated by involutory reflexions arise naturally in the modern theory of ab...
Abstract We consider semidefinite programming problems on which a permutation group is acting. We de...
In this paper we list all possible degrees of a faithful transitive permutation representation of th...
AbstractThere is a well-known correspondence between abstract regular polytopes and string C-groups....
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
AbstractThis paper addresses the problem of finding abstract regular polytopes with preassigned face...
AbstractWe say that a (d+1)-polytope P is an extension of a polytope K if the facets or the vertex f...
AbstractThis paper studies C-group permutation representation graphs, or for short, CPR graphs. C-gr...
We give conditions for oriented labeled graphs that must be satisfied in order that such are permut...
AbstractIn a previous paper we constructed a finite regular (abstract) 4-polytope of type {3,3,p} fo...
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial...
AbstractIn the classical setting, a convex polytope is said to be semiregular if its facets are regu...
Up to isomorphism and duality, there are exactly two nondegener-ate abstract regular polytopes of ra...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
Complex groups generated by involutory reflexions arise naturally in the modern theory of abstract r...
AbstractComplex groups generated by involutory reflexions arise naturally in the modern theory of ab...
Abstract We consider semidefinite programming problems on which a permutation group is acting. We de...
In this paper we list all possible degrees of a faithful transitive permutation representation of th...
AbstractThere is a well-known correspondence between abstract regular polytopes and string C-groups....
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
DOI
Add to ORKG