Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Width of the Regular nn-Simplex

Published 6 Jan 2023 in cs.CG | (2301.02616v1)

Abstract: Consider the regular nn-simplex Δn\Delta_n - it is formed by the convex-hull of n+1n+1 points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of Δn\Delta_n which is ≈2/n\approx \sqrt{2/n}. Specifically, width(Δn)=2n+1 \mathrm{width}(\Delta_n) = \sqrt{\frac{2}{n + 1}} if nn is odd, and width(Δn)=2(n+1)n(n+2) \mathrm{width}(\Delta_n) = \sqrt{\frac{2(n+1)}{n(n+2)}} if nn is even. While this bound is well known [GK92, Ale77], we provide a self-contained elementary proof that might (or might not) be of interest.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.