Combinatorially two-orbit convex polytopes

DOI10.1007/S00454-015-9752-4MaRDI QIDQ282754zbMATH OpenOpenAlexFDO

Authors Nicholas Matteo

Publication date 12 May 2016

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.1782

zbMATH Keywords

convex polytopeshalf-regularquasiregulartilingstwo-orbit

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Symmetry properties of polytopes (52B15) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Abstract: Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide.) Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, icosidodecahedron, rhombic dodecahedron, or rhombic triacontahedron. The same is true of combinatorially two-orbit normal face-to-face tilings by convex polytopes.

Review text

For a regular convex polytope its symmetry group acts transitively on its flags, i.e., the symmetry group has one orbit on the flags. For a two-orbit convex polytope, the symmetry group has two orbits on the flags. All the two-orbit convex polytopes were found in the author's previous article [Discrete Comput. Geom. 55, No. 2, 296--313 (2016; Zbl 1341.52034)]. In the paper under review, for a convex polytope, the author cosiders combinatorial automorphisms of its face lattice instead of Euclidean symmetries. It is proved that any combinatorially two-orbit convex polytope is isomorphic to a (geometrically) two-orbit convex polytope. So such a polytope is 3-dimensional and is isomorphic to one of the following list: the cuboctahedron, the icosidodecahedron, the rhombic dodecahedron, or the rhombic triacontahedron. Also combinatorially two-orbit normal face-to-face tilings by convex polytopes are studied. It is shown that such tilings exist only in dimensions two and three.

Recommendations

• Two-orbit convex polytopes and tilings
• Any finite group is the group of some binary, convex polytope
• Two-orbit polyhedra from groups
• Regular polyhedra of index two. I.
• Regular polyhedra of index two. II.

Cites work

• Abstract Regular Polytopes
• Combinatorially regular polytopes
• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 1182896 (Why is no real title available?)
• scientific article; zbMATH DE number 3048077 (Why is no real title available?)
• Monodromy groups and self-invariance
• On combinatorial and affine automorphisms of polytopes
• Semiregular polytopes and amalgamated C-groups
• The existence on non-tiles and non-facets in three dimensions
• Two-orbit convex polytopes and tilings
• Two-orbit polyhedra from groups

Cited in

(7)

• Open problems on \(k\)-orbit polytopes
• Two-orbit convex polytopes and tilings
• Prescribing symmetries and automorphisms for polytopes
• An effective solution to convex 1-body N-representability
• Polytopality of 2-orbit maniplexes
• Regular polyhedra of index two. II.
• Two-orbit polyhedra from groups

This page was built for publication: Combinatorially two-orbit convex polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282754)