von Stengel's conjecture on estranged facet pairs of simplicial polytopes
von Stengel's conjecture on estranged facet pairs of simplicial polytopes
Let be a simplicial -polytope with vertices. Two facets are estranged if they are disjoint. Von Stengel's conjecture. The maximum number of pairs of estranged facets of any simplicial -polytope with vertices is
which is attained by the -dimensional cross polytope. This conjecture gives a deterministic extremal benchmark for the expected number of estranged facet pairs in random point sets; the paper places its Gaussian estimate in this context, but the supplied text does not state whether the conjecture has been resolved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Brett Leroux and Luis Rademacher, “Estranged facets and k-facets of Gaussian random point sets”, arXiv:2307.00687 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.