AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking quotients with respect to elementary Abelian subgroups (linear codes) of the automorphism group
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
The concept of regular incidence-complexes generalizes the notion of regular polytopes in a combinat...
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking qu...
AbstractWe present the results of an investigation into the representations of Archimedean polyhedra...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractWhen the standard representation of a crystallographic Coxeter group G (with string diagram)...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
AbstractThe paper discusses a general method for constructing regular incidence-polytopes P from cer...
In polyhedral combinatorics, some well-known polytopes are related to lattice congruences of the wea...
AbstractRegular incidence-polytopes are combinatorial generalizations of regular polyhedra. Certain ...
Regularity has often been present in the form of regular polyhedra or tessellations; classical examp...
For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, 2015) establis...
AbstractIn recent years the term ‘chiral’ has been used for geometric and combinatorial figures whic...
Abstract. We consider d-dimensional lattice polytopes ∆ with h∗-polynomial h∗ ∆ = 1 + h kt k for 1 ...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
The concept of regular incidence-complexes generalizes the notion of regular polytopes in a combinat...
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking qu...
AbstractWe present the results of an investigation into the representations of Archimedean polyhedra...
In this paper we describe the data structures and the procedures of a program, which is...
AbstractWhen the standard representation of a crystallographic Coxeter group G (with string diagram)...
AbstractThis paper contains a classification of the regular minimal abstract polytopes that act as c...
AbstractThe paper discusses a general method for constructing regular incidence-polytopes P from cer...
In polyhedral combinatorics, some well-known polytopes are related to lattice congruences of the wea...
AbstractRegular incidence-polytopes are combinatorial generalizations of regular polyhedra. Certain ...
Regularity has often been present in the form of regular polyhedra or tessellations; classical examp...
For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, 2015) establis...
AbstractIn recent years the term ‘chiral’ has been used for geometric and combinatorial figures whic...
Abstract. We consider d-dimensional lattice polytopes ∆ with h∗-polynomial h∗ ∆ = 1 + h kt k for 1 ...
In this paper, various algorithms used in the classifications of regular polytopes for given groups ...
The concept of regular incidence-complexes generalizes the notion of regular polytopes in a combinat...
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
DOI
Add to ORKG