An upper bound on the shortness exponent of inscribable polytopes (Q1122592)

From MaRDI portal
Revision as of 17:11, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound on the shortness exponent of inscribable polytopes
scientific article

    Statements

    An upper bound on the shortness exponent of inscribable polytopes (English)
    0 references
    1989
    0 references
    The author constructs a non-Hamiltonian simplicial 3-polytope with 25 vertices inscribable into the sphere. This polytope is used as a building block for a series of examples showing that the shortness exponent of this class of polytopes is bounded from above by \(\log_ 98\). The series is constructed by the methods of \textit{B. Grünbaum} and \textit{H. Walther} [J. Comb. Theory, Ser. A 14, 364-385 (1973; Zbl 0263.05103)]. The inscribability is proved by realizing the graphs as (augmented) non- degenerate Delaunay triangulations.
    0 references
    Hamiltonian circuit
    0 references
    3-polytope
    0 references
    inscribable
    0 references
    shortness exponent
    0 references
    Delaunay triangulations
    0 references

    Identifiers