The enumeration of four-dimensional polytopes (Q1179273): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90159-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017282008 / rank | |||
Normal rank |
Latest revision as of 09:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The enumeration of four-dimensional polytopes |
scientific article |
Statements
The enumeration of four-dimensional polytopes (English)
0 references
26 June 1992
0 references
A 3-sphere is a (face-to-face) cell complex on a sphere in 4-dimensional space. Radial projection gives, for each convex polytope in 4-space, a combinatorially equivalent 3-sphere whereas it is known that not all 3- spheres have their polytope counterpart. The paper gives an algorithm for enumerating all possible combinatorial types of 3-spheres. Using a cutting operation (similar to cutting a polytope with a hyperplane) it is possible to derive all 3-spheres with \(n\) cells from the one with \(n-1\) cells. The paper gives implementation details and computational results, including complete listings of 3-spheres with few vertices. In most cases, the produced 3-spheres could be classified into polytopical or not.
0 references
3-sphere
0 references
\(n\)-polytope
0 references
enumeration
0 references
algorithm
0 references
0 references