Hyperbolic Coxeter \(n\)-polytopes with \(n+2\) facets (Q1889676)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hyperbolic Coxeter \(n\)-polytopes with \(n+2\) facets
scientific article

    Statements

    Hyperbolic Coxeter \(n\)-polytopes with \(n+2\) facets (English)
    0 references
    7 December 2004
    0 references
    A polytope \(P\) in the \(n\)-dimensional hyperbolic space \(H^{n}\) is called a Coxeter polytope if the dihedral angles of \(P\) are integer parts of \(\pi\). The reflections of \(H^n\) with respect to the facets of a Coxeter polytope \(P\) generate a discrete group \(G\), and \(P\) is the fundamental domain of \(G\). The main problem considered by the author is to classify the Coxeter polytopes in \(H^{n}\). Coxeter polytopes with finite volume in \(H^3\) were described by E. Andreev. The hyperbolic simplices were classified by E. Vinberg and F. Lanner. All Coxeter simplicial prisms were classified by E. Kaplinskaya. Recently, F. Esselman classified the compact Coxeter polytopes with \(n+2\) facets in \(H^{n}\). The present author proposes a combinatorial classification of the non-compact Coxeter polytopes with finite volume and with \(n+2\) facets in \(H^{n+1}\). It is demonstrated that the combinatorial type of a Coxeter polytope with \(n+2\) facets in \(H^n\) is either the product of two simplices or the pyramid over a product of two simplices. In the first case there is a unique non-compact Coxeter polytope of finite volume in \(H^n\) which is combinatorially equivalent to the product of two simplices of dimension greater than one. In the second case the non-compact Coxeter polytopes of finite volume combinatorially equivalent to a pyramid over a product of two simplices are described with the help of Coxeter diagrams.
    0 references
    0 references
    0 references
    0 references
    0 references
    hyperbolic space
    0 references
    Coxeter polytope
    0 references
    Gale diagram
    0 references
    Lanner diagram
    0 references
    0 references
    0 references
    0 references