There is no face-to-face partition of \(R^5\) into acute simplices

DOI10.1007/s00454-006-1244-0zbMath1103.52008OpenAlexW1972799695MaRDI QIDQ2505229

Michal Křížek

Publication date: 4 October 2006

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-006-1244-0

zbMATH Keywords

tilingparticle physicsdihedral anglesacute simplex600-cell\(d\)-simplexacute angle

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (11)

Nonobtuse triangulations of PSLGs ⋮ Acute Geodesic Triangulations of Manifolds ⋮ Uniformly acute triangulations of polygons ⋮ Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions ⋮ The discrete maximum principle for Galerkin solutions of elliptic problems ⋮ On angle conditions in the finite element method ⋮ Acute triangulations of polyhedra and \(\mathbb R^N\) ⋮ Existence of well-centered simplicial face-to-face tiling of five-dimensional space ⋮ The discrete maximum principle for linear simplicial finite element approximations of a reaction-diffusion problem ⋮ A dihedral acute triangulation of the cube ⋮ On a Discrete Maximum Principle for Linear FE Solutions of Elliptic Problems with a Nondiagonal Coefficient Matrix

This page was built for publication: There is no face-to-face partition of \(R^5\) into acute simplices