Are all convex polyhedra tetragonalizable? (Q2825806)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Are all convex polyhedra tetragonalizable? |
scientific article; zbMATH DE number 6638579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are all convex polyhedra tetragonalizable? |
scientific article; zbMATH DE number 6638579 |
Statements
13 October 2016
0 references
tetragonalization
0 references
Platonic solids
0 references
semiregular polyhedra
0 references
circumscribed polyhedra
0 references
inscribe polyhedra
0 references
0.88048196
0 references
0.78314877
0 references
0 references
0.75984573
0 references
0.7572315
0 references
0.75648105
0 references
Are all convex polyhedra tetragonalizable? (English)
0 references
A convex polyhedron in 3-space is called tetragonizable by a family of pyramids, all of them erected on the facets of that polyhedron, if the two pyramidal faces containing one of the edges of the original polyhedron are coplanar, thus forming a convex quadrangle which is then a facet of the obtained tetragonalization. E.g., the cube is a tetragonalization of the regular tetrahedron, the rhombic dodecahedron of the cube, and the rhombitriacontahedron of the regular icosahedron. Based on the nice (and unsettled) conjecture that each convex polyhedron is tetragonizable, and supporting this conjecture, the author proves that all simplicial polyhedra (having only triangular facets) are tetragonizable, and that all midscribable polyhedra (all whose edges are tangent to a sphere) have the same property.NEWLINENEWLINE Further parts of this nice paper refer to in-, mid- and circumscribable polyhedra and the conjecture that every tetragonizable polyhedron admits a continuum of tetragonalizations.
0 references