Dissection into orthoschemes

Last updated December 03, 2023

Unsolved problem in mathematics:

Can every simplex be dissected into a bounded number of orthoschemes?

Definitions and statement

In this context, a simplex in $d$ -dimensional Euclidean space is the convex hull of $d+1$ points that do not all lie in a common hyperplane. For example, a 2-dimensional simplex is just a triangle (the convex hull of three points in the plane) and a 3-dimensional simplex is a tetrahedron (the convex of four points in three-dimensional space). The points that form the simplex in this way are called its vertices.

An orthoscheme, also called a path simplex, is a special kind of simplex. In it, the vertices can be connected by a path, such that every two edges in the path are at right angles to each other. A two-dimensional orthoscheme is a right triangle. A three-dimensional orthoscheme can be constructed from a cube by finding a path of three edges of the cube that do not all lie on the same square face, and forming the convex hull of the four vertices on this path.

A dissection of a shape $S$ (which may be any closed set in Euclidean space) is a representation of $S$ as a union of other shapes whose interiors are disjoint from each other. That is, intuitively, the shapes in the union do not overlap, although they may share points on their boundaries. For instance, a cube can be dissected into six three-dimensional orthoschemes. A similar result applies more generally: every hypercube or hyperrectangle in $d$ dimensions can be dissected into $d!$ orthoschemes.

Hadwiger's conjecture is that there is a function $f$ such that every $d$ -dimensional simplex can be dissected into at most $f(d)$ orthoschemes. Hadwiger posed this problem in 1956;^[2] it remains unsolved in general, although special cases for small values of $d$ are known.^[1]

In small dimensions

The altitude from a sharp angle may fail to dissect a triangle, but the altitude from its widest angle always dissects it into two right triangles Altezza.svg — The altitude from a sharp angle may fail to dissect a triangle, but the altitude from its widest angle always dissects it into two right triangles

In two dimensions, every triangle can be dissected into at most two right triangles, by dropping an altitude from its widest angle onto its longest edge.^[2]

In three dimensions, some tetrahedra can be dissected in a similar way, by dropping an altitude perpendicularly from a vertex $v$ to a point $p$ in an opposite face, connecting $p$ perpendicularly to the sides of the face, and using the three-edge perpendicular paths through $v$ and $p$ to a side and then to a vertex of the face.^[2] However, this does not always work. In particular, there exist tetrahedra for which none of the vertices have altitudes with a foot inside the opposite face. Using a more complicated construction, Lenhard (1960) proved that every tetrahedron can be dissected into at most 12 orthoschemes.^[3] Böhm (1980) proved that this is optimal: there exist tetrahedra that cannot be dissected into fewer than 12 orthoschemes.^[4] In the same paper, Böhm also generalized Lenhard's result to three-dimensional spherical geometry and three-dimensional hyperbolic geometry.

In four dimensions, at most 500 orthoschemes are needed.^[5] In five dimensions, a finite number of orthoschemes is again needed, roughly bounded as at most 12.5 million. Again, this applies to spherical geometry and hyperbolic geometry as well as to Euclidean geometry.^[6]

Hadwiger's conjecture remains unproven for all dimensions greater than five.^[1]

Consequences

Every convex polytope may be dissected into simplexes. Therefore, if Hadwiger's conjecture is true, every convex polytope would also have a dissection into orthoschemes.^[6]

A related result is that every orthoscheme can itself be dissected into $d$ or $d+1$ smaller orthoschemes.^[7]^[8] Therefore, for simplexes that can be partitioned into orthoschemes, their dissections can have arbitrarily large numbers of orthoschemes.

Related Research Articles

<span class="mw-page-title-main">Octahedron</span> Polyhedron with eight triangular faces

In geometry, an octahedron is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex.

<span class="mw-page-title-main">Tetrahedron</span> Polyhedron with 4 faces

In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra.

In geometry, a tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes.

In four-dimensional geometry, the 24-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,4,3}. It is also called C₂₄, or the icositetrachoron, octaplex (short for "octahedral complex"), icosatetrahedroid, octacube, hyper-diamond or polyoctahedron, being constructed of octahedral cells.

In geometry, the Dehn invariant is a value used to determine whether one polyhedron can be cut into pieces and reassembled ("dissected") into another, and whether a polyhedron or its dissections can tile space. It is named after Max Dehn, who used it to solve Hilbert's third problem by proving that not all polyhedra with equal volume could be dissected into each other.

In geometry, the 5-cell is the convex 4-polytope with Schläfli symbol {3,3,3}. It is a 5-vertex four-dimensional object bounded by five tetrahedral cells. It is also known as a C₅, pentachoron, pentatope, pentahedroid, or tetrahedral pyramid. It is the 4-simplex (Coxeter's $polytope), the simplest possible convex 4-polytope, and is analogous to the tetrahedron in three dimensions and the triangle in two dimensions. The 5-cell is a 4-dimensional pyramid with a tetrahedral base and four tetrahedral sides.$

<span class="mw-page-title-main">Hugo Hadwiger</span> Swiss mathematician (1908–1981)

Hugo Hadwiger was a Swiss mathematician, known for his work in geometry, combinatorics, and cryptography.

In geometry, the 16-cell is the regular convex 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,4}. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. It is also called C₁₆, hexadecachoron, or hexdecahedroid [sic?].

<span class="mw-page-title-main">Convex polytope</span> Convex hull of a finite set of points in a Euclidean space

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the $-dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.$

In geometry of 4 dimensions or higher, a double prism or duoprism is a polytope resulting from the Cartesian product of two polytopes, each of two dimensions or higher. The Cartesian product of an $n$ -polytope and an $m$ -polytope is an $(n + m)$ -polytope, where $n$ and $m$ are dimensions of 2 (polygon) or higher.

The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating regular octahedra and tetrahedra in a ratio of 1:2.

The quarter cubic honeycomb, quarter cubic cellulation or bitruncated alternated cubic honeycomb is a space-filling tessellation in Euclidean 3-space. It is composed of tetrahedra and truncated tetrahedra in a ratio of 1:1. It is called "quarter-cubic" because its symmetry unit – the minimal block from which the pattern is developed by reflections – is four times that of the cubic honeycomb.

In five-dimensional geometry, a rectified 5-simplex is a convex uniform 5-polytope, being a rectification of the regular 5-simplex.

In 7-dimensional geometry, 2₃₁ is a uniform polytope, constructed from the E7 group.

In geometry, the Hill tetrahedra are a family of space-filling tetrahedra. They were discovered in 1896 by M. J. M. Hill, a professor of mathematics at the University College London, who showed that they are scissor-congruent to a cube.

In geometry, a Schläfli orthoscheme is a type of simplex. The orthoscheme is the generalization of the right triangle to simplex figures of any number of dimensions. Orthoschemes are defined by a sequence of edges $that are mutually orthogonal. They were introduced by Ludwig Schläfli, who called them orthoschemes and studied their volume in Euclidean, hyperbolic, and spherical geometries. H. S. M. Coxeter later named them after Schläfli. As right triangles provide the basis for trigonometry, orthoschemes form the basis of a trigonometry of n dimensions, as developed by Schoute who called it polygonometry . J.-P. Sydler and Børge Jessen studied orthoschemes extensively in connection with Hilbert's third problem.$

In combinatorial geometry, the Hadwiger conjecture states that any convex body in n-dimensional Euclidean space can be covered by 2ⁿ or fewer smaller bodies homothetic with the original body, and that furthermore, the upper bound of 2ⁿ is necessary if and only if the body is a parallelepiped. There also exists an equivalent formulation in terms of the number of floodlights needed to illuminate the body.

In geometry and polyhedral combinatorics, a $k$ -neighborly polytope is a convex polytope in which every set of $k$ or fewer vertices forms a face. For instance, a 2-neighborly polytope is a polytope in which every pair of vertices is connected by an edge, forming a complete graph. 2-neighborly polytopes with more than four vertices may exist only in spaces of four or more dimensions, and in general a $k$ -neighborly polytope requires a dimension of $2 k$ or more. A $d$ -simplex is $d$ -neighborly. A polytope is said to be neighborly, without specifying $k$ , if it is $k$ -neighborly for $k = ⌊ d ⁄ 2 ⌋$ . If we exclude simplices, this is the maximum possible $k$ : in fact, every polytope that is $k$ -neighborly for some $k \geq 1 + ⌊ d ⁄ 2 ⌋$ is a simplex.

In geometry, Kalai's 3^d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states that every d-dimensional centrally symmetric polytope has at least 3^d nonempty faces.

References

1 2 3 Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions" (PDF), SIAM Review, 51 (2): 317–335, doi:10.1137/060669073, MR 2505583 . See in particular Conjecture 23, p. 327.
1 2 3 Hadwiger, Hugo (1956), "Ungelöste Probleme", Elemente der Mathematik, 11: 109–110
↑ Lenhard, H.-Chr. (1960), "Zerlegung von Tetraedern in Orthogonaltetraeder", Elemente der Mathematik, 15: 106–107, MR 0116226
↑ Böhm, Johannes (1980), "Zur vollständigen Zerlegung der euklidischen und nichteuklidischen Tetraeder in Orthogonal-Tetraeder", Martin-Luther-Universität Halle-Wittenberg (9): 29–54, MR 0579516
↑ Tschirpke, Katrin (1993), "On the dissection of simplices into orthoschemes", Geometriae Dedicata , 46 (3): 313–329, doi:10.1007/BF01263622, MR 1220122
1 2 Tschirpke, Katrin (1994), "The dissection of five-dimensional simplices into orthoschemes", Beiträge zur Algebra und Geometrie, 35 (1): 1–11, MR 1287191
↑ Debrunner, Hans E. (1990), "Dissecting orthoschemes into orthoschemes", Geometriae Dedicata , 33 (2): 123–152, doi:10.1007/BF00183080, MR 1050606
↑ Brandts, Jan; Korotov, Sergey; Křížek, Michal (2007), "Dissection of the path-simplex in $\mathbb {R} ^{n}$ into $n$ path-subsimplices", Linear Algebra and its Applications, 421 (2–3): 382–393, doi: 10.1016/j.laa.2006.10.010 , MR 2294350

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[bkks-1] 1 2 3 Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions" (PDF), SIAM Review, 51 (2): 317–335, doi:10.1137/060669073, MR 2505583 . See in particular Conjecture 23, p. 327.

[hh-2] 1 2 3 Hadwiger, Hugo (1956), "Ungelöste Probleme", Elemente der Mathematik, 11: 109–110

[len-3] Lenhard, H.-Chr. (1960), "Zerlegung von Tetraedern in Orthogonaltetraeder", Elemente der Mathematik, 15: 106–107, MR 0116226

[bohm-4] Böhm, Johannes (1980), "Zur vollständigen Zerlegung der euklidischen und nichteuklidischen Tetraeder in Orthogonal-Tetraeder", Martin-Luther-Universität Halle-Wittenberg (9): 29–54, MR 0579516

[tschirpke93-5] Tschirpke, Katrin (1993), "On the dissection of simplices into orthoschemes", Geometriae Dedicata , 46 (3): 313–329, doi:10.1007/BF01263622, MR 1220122

[tschirpke94-6] 1 2 Tschirpke, Katrin (1994), "The dissection of five-dimensional simplices into orthoschemes", Beiträge zur Algebra und Geometrie, 35 (1): 1–11, MR 1287191

[debrunner-7] Debrunner, Hans E. (1990), "Dissecting orthoschemes into orthoschemes", Geometriae Dedicata , 33 (2): 123–152, doi:10.1007/BF00183080, MR 1050606

[bkk-8] Brandts, Jan; Korotov, Sergey; Křížek, Michal (2007), "Dissection of the path-simplex in $\mathbb {R} ^{n}$ into $n$ path-subsimplices", Linear Algebra and its Applications, 421 (2–3): 382–393, doi: 10.1016/j.laa.2006.10.010 , MR 2294350

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]