In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one.
A complex polytope may be understood as a collection of complex points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on.
Precise definitions exist only for the regular complex polytopes, which are configurations. The regular complex polytopes have been completely characterized, and can be described using a symbolic notation developed by Coxeter.
Some complex polytopes which are not fully regular have also been described.
The complex line has one dimension with real coordinates and another with imaginary coordinates. Applying real coordinates to both dimensions is said to give it two dimensions over the real numbers. A real plane, with the imaginary axis labelled as such, is called an Argand diagram. Because of this it is sometimes called the complex plane. Complex 2-space (also sometimes called the complex plane) is thus a four-dimensional space over the reals, and so on in higher dimensions.
A complex n-polytope in complex n-space is the analogue of a real n-polytope in real n-space.
There is no natural complex analogue of the ordering of points on a real line (or of the associated combinatorial properties). Because of this a complex polytope cannot be seen as a contiguous surface and it does not bound an interior in the way that a real polytope does.
In the case of regular polytopes, a precise definition can be made by using the notion of symmetry. For any regular polytope the symmetry group (here a complex reflection group, called a Shephard group) acts transitively on the flags, that is, on the nested sequences of a point contained in a line contained in a plane and so on.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
DISPLAYTITLE:2 21 polytope In 6-dimensional geometry, the 221 polytope is a uniform 6-polytope, constructed within the symmetry of the E6 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 6-ic semi-regular figure. It is also called the Schläfli polytope. Its Coxeter symbol is 221, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of one of the 2-node sequences. He also studied its connection with the 27 lines on the cubic surface, which are naturally in correspondence with the vertices of 221.
DISPLAYTITLE:4 21 polytope In 8-dimensional geometry, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 8-ic semi-regular figure. Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 4-node sequences, . The rectified 421 is constructed by points at the mid-edges of the 421. The birectified 421 is constructed by points at the triangle face centers of the 421.
In the geometry of 4 dimensions, the 3-3 duoprism or triangular duoprism is a four-dimensional convex polytope. It can be constructed as the Cartesian product of two triangles and is the simplest of an infinite family of four-dimensional polytopes constructed as Cartesian products of two polygons, the duoprisms. It has 9 vertices, 18 edges, 15 faces (9 squares, and 6 triangles), in 6 triangular prism cells. It has Coxeter diagram , and symmetry , order 72. Its vertices and edges form a rook's graph.
We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...
SPRINGER2020
Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topological-equivalent subspace with a sequence of elementary moves. Recently, discrete Morse theory techniques provided an efficient way to construct deformatio ...
The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...