Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices (Q869907)

From MaRDI portal





scientific article; zbMATH DE number 5132605
Language Label Description Also known as
default for all languages
No label defined
    English
    Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
    scientific article; zbMATH DE number 5132605

      Statements

      Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices (English)
      0 references
      9 March 2007
      0 references
      The paper mainly refers to geometric properties and dissections of orthoschemes or path-simplices in Euclidean \(n\)-space. First the authors give a nice review on basic properties of \(n\)-dimensional non-obtuse simplices (i.e., none of their dihedral angles is obtuse) and the subfamily of such simplices without right dihedral angles, called acute simplices. They continue with an interesting discussion of ortho-simplices (having \(n\) mutually orthogonal edges) and the subfamily of path-simplices (where these \(n\) mutually orthogonal edges form a path). Then they prove that path-simplices can be subdivided into \(n+1\) path-subsimplices. As a degenerate case, the possibility of respective subdivisions into \(n\) path-simplices follows, and this yields the \(n\)-dimensional analogue of a result of H. S. M. Coxeter for \(n=3\): a path-tetrahedron can be dissected into three path-subtetrahedra. Further investigations lead even to self-similar path-simplicial dissections of path-simplices, where all paths of mutually orthogonal edges end at the same vertex of the dissected original simplex.
      0 references
      0 references
      \(n\)-simplex
      0 references
      acute simplex
      0 references
      self-similarity
      0 references
      non-obtuse simplex
      0 references
      orthoscheme
      0 references
      Gram matrix
      0 references
      dihedral angle
      0 references
      Coxeter's trisection theorem
      0 references
      0 references
      0 references
      0 references

      Identifiers