AbstractThere is a well-known correspondence between abstract regular polytopes and string C-groups. In this paper, for each d⩾3, a string C-group with d generators, isomorphic to an alternating group of degree n is constructed (for some n⩾9), or equivalently an abstract regular d-polytope, is produced with automorphism group Alt(n). A method that extends the CPR graph of a polytope to a different CPR graph of a larger (or possibly isomorphic) polytope is used to prove that various groups are themselves string C-groups
We show that a rank reduction technique for string C-group representations first used in [Adv. Math....
This paper determines the non-degenerate string C-groups of order1024. For groups of rank 3, we use ...
This paper examines abstract regular polytopes whose automorphism group is the projective special li...
There is a well-known correspondence between abstract regular polytopes and string C-groups. In this...
Using the correspondence between abstract regular polytopes and string C-groups, in a recent paper [...
We prove that the highest rank of a string C-group constructed from an alternating group An is 3 if ...
We prove that for any integer n ≥ 12, and for every r in the interval [3, . . . , Floor((n−1)/2)], t...
AbstractThis paper studies C-group permutation representation graphs, or for short, CPR graphs. C-gr...
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 ...
There have been many investigations on the combinatorial structures and invariants over the group ac...
We give presentations for the C-groups of rank n−1 of the symmetric group Sn. We also classify C-gro...
We give examples of finite string C-groups (the automorphism groups of abstract regular polytopes) t...
AbstractIn the Atlas of abstract regular polytopes for small almost simple groups by Leemans and Vau...
We give conditions for oriented labeled graphs that must be satisfied in order that such are permut...
We show that a rank reduction technique for string C-group representations first used in [Adv. Math....
This paper determines the non-degenerate string C-groups of order1024. For groups of rank 3, we use ...
This paper examines abstract regular polytopes whose automorphism group is the projective special li...
There is a well-known correspondence between abstract regular polytopes and string C-groups. In this...
Using the correspondence between abstract regular polytopes and string C-groups, in a recent paper [...
We prove that the highest rank of a string C-group constructed from an alternating group An is 3 if ...
We prove that for any integer n ≥ 12, and for every r in the interval [3, . . . , Floor((n−1)/2)], t...
AbstractThis paper studies C-group permutation representation graphs, or for short, CPR graphs. C-gr...
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 ...
There have been many investigations on the combinatorial structures and invariants over the group ac...
We give presentations for the C-groups of rank n−1 of the symmetric group Sn. We also classify C-gro...
We give examples of finite string C-groups (the automorphism groups of abstract regular polytopes) t...
AbstractIn the Atlas of abstract regular polytopes for small almost simple groups by Leemans and Vau...
We give conditions for oriented labeled graphs that must be satisfied in order that such are permut...
We show that a rank reduction technique for string C-group representations first used in [Adv. Math....
This paper determines the non-degenerate string C-groups of order1024. For groups of rank 3, we use ...
This paper examines abstract regular polytopes whose automorphism group is the projective special li...