In the study of abstract polytopes, a chiral polytope is that it is a polytope that is as symmetric as possible without being mirror-symmetric, formalized in terms of the action of the symmetry group of the polytope on its flags.
In the study of abstract polytopes, a chiral polytope is that it is a polytope that is as symmetric as possible without being mirror-symmetric, formalized in terms of the action of the symmetry group of the polytope on its flags.
The more technical definition of a chiral polytope is a polytope that has two orbits of flags under its group of symmetries, with adjacent flags in different orbits. This implies that it must be vertex-transitive, edge-transitive, and face-transitive, as each vertex, edge, or face must be represented by flags in both orbits; however, it cannot be mirror-symmetric, as every mirror symmetry of the polytope would exchange some pair of adjacent flags. [1]
For the purposes of this definition, the symmetry group of a polytope may be defined in either of two different ways: it can refer to the symmetries of a polytope as a geometric object (in which case the polytope is called geometrically chiral) or it can refer to the symmetries of the polytope as a combinatorial structure (the automorphisms of an abstract polytope). Chirality is meaningful for either type of symmetry but the two definitions classify different polytopes as being chiral or nonchiral. [2]
Geometrically chiral polytopes are relatively exotic compared to the more ordinary regular polytopes. It is not possible for a geometrically chiral polytope to be convex, [3] and many geometrically chiral polytopes of note are skew.
In three dimensions, it is not possible for a geometrically chiral polytope to have finitely many finite faces. For instance, the snub cube is vertex-transitive, but its flags have more than two orbits, and it is neither edge-transitive nor face-transitive, so it is not symmetric enough to meet the formal definition of chirality. The quasiregular polyhedra and their duals, such as the cuboctahedron and the rhombic dodecahedron, provide another interesting type of near-miss: they have two orbits of flags, but are mirror-symmetric, and not every adjacent pair of flags belongs to different orbits. However, despite the nonexistence of finite chiral three-dimensional polyhedra, there exist infinite three-dimensional chiral skew polyhedra of types {4,6}, {6,4}, and {6,6}. [2]
 | This section needs expansion. You can help by adding to it. (January 2024) |
In four dimensions, there are a geometrically chiral finite polytopes. One example is Roli's cube, a skew polytope on the skeleton of the 4-cube. [4] [5]
In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.
In elementary geometry, a polytope is a geometric object with flat sides (faces). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a (k + 1)-polytope consist of k-polytopes that may have (k – 1)-polytopes in common.
In geometry, a polyhedral compound is a figure that is composed of several polyhedra sharing a common centre. They are the three-dimensional analogs of polygonal compounds such as the hexagram.
A regular polyhedron is a polyhedron whose symmetry group acts transitively on its flags. A regular polyhedron is highly symmetrical, being all of edge-transitive, vertex-transitive and face-transitive. In classical contexts, many different equivalent definitions are used; a common one is that the faces are congruent regular polygons which are assembled in the same way around each vertex.
In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. In particular, all its elements or j-faces — cells, faces and so on — are also transitive on the symmetries of the polytope, and are themselves regular polytopes of dimension j≤ n.
In mathematics, an abstract polytope is an algebraic partially ordered set which captures the dyadic property of a traditional polytope without specifying purely geometric properties such as points and lines.
In the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three edges. It was discovered by Marion C. Gray in 1932 (unpublished), then discovered independently by Bouwer 1968 in reply to a question posed by Jon Folkman 1967. The Gray graph is interesting as the first known example of a cubic graph having the algebraic property of being edge but not vertex transitive.
In geometry, an apeirogon or infinite polygon is a polygon with an infinite number of sides. Apeirogons are the two-dimensional case of infinite polytopes. In some literature, the term "apeirogon" may refer only to the regular apeirogon, with an infinite dihedral group of symmetries.
In geometry, a honeycomb is a space filling or close packing of polyhedral or higher-dimensional cells, so that there are no gaps. It is an example of the more general mathematical tiling or tessellation in any number of dimensions. Its dimension can be clarified as n-honeycomb for a honeycomb of n-dimensional space.
In geometry, a skew polygon is a polygon whose vertices are not all coplanar. Skew polygons must have at least four vertices. The interior surface of such a polygon is not uniquely defined.
In geometry, a skew apeirohedron is an infinite skew polyhedron consisting of nonplanar faces or nonplanar vertex figures, allowing the figure to extend indefinitely without folding round to form a closed surface.
In geometry, an apeirotope or infinite polytope is a generalized polytope which has infinitely many facets.
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon in which every n – 1 consecutive sides belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a regular polyhedron is a skew polygon such that every two consecutive sides belongs to one of the faces. Petrie polygons are named for mathematician John Flinders Petrie.
In geometry, the regular skew polyhedra are generalizations to the set of regular polyhedra which include the possibility of nonplanar faces or vertex figures. Coxeter looked at skew vertex figures which created new 4-dimensional regular polyhedra, and much later Branko Grünbaum looked at regular skew faces.
In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold into topological disks such that every flag can be transformed into any other flag by a symmetry of the decomposition. Regular maps are, in a sense, topological generalizations of Platonic solids. The theory of maps and their classification is related to the theory of Riemann surfaces, hyperbolic geometry, and Galois theory. Regular maps are classified according to either: the genus and orientability of the supporting surface, the underlying graph, or the automorphism group.
In geometry, a (globally) projective polyhedron is a tessellation of the real projective plane. These are projective analogs of spherical polyhedra – tessellations of the sphere – and toroidal polyhedra – tessellations of the toroids.
In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other. Such a graph is a vertex-transitive graph but cannot be an edge-transitive graph: the number of symmetries equals the number of vertices, too few to take every edge to every other edge.
In geometry, a regular skew apeirohedron is an infinite regular skew polyhedron. They have either skew regular faces or skew regular vertex figures.
Isabel Alicia Hubard Escalera is a Mexican mathematician in the Institute of Mathematics of the National Autonomous University of Mexico (UNAM).