On the Width of the Regular $n$-Simplex

arxiv(2023)

引用 0|浏览19
暂无评分
摘要
Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+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 $\Delta_n$ which is $\approx \sqrt{2/n}$. Specifically, $ \mathrm{width}(\Delta_n) = \sqrt{\frac{2}{n + 1}}$ if $n$ is odd, and $ \mathrm{width}(\Delta_n) = \sqrt{\frac{2(n+1)}{n(n+2)}} $ if $n$ 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.
更多
查看译文
关键词
width,regular
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要