On the Width of the Regular n-Simplex

01/06/2023
by   Sariel Har-Peled, et al.
0

Consider the regular n-simplex Δ_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 Δ_n which is ≈√(2/n). Specifically, width(Δ_n) = √(2/n + 1) if n is odd, and width(Δ_n) = √(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.

READ FULL TEXT

page 1

page 2

page 3

research
12/06/2021

A Proof of the Simplex Mean Width Conjecture

The mean width of a convex body is the average distance between parallel...
research
07/14/2021

An Elementary Proof of the 3 Dimensional Simplex Mean Width Conjecture

After a Hessian computation, we quickly prove the 3D simplex mean width ...
research
12/03/2022

Approximation and Semantic Tree-width of Conjunctive Regular Path Queries

We show that the problem of whether a query is equivalent to a query of ...
research
01/10/2023

Neighbourhood complexity of graphs of bounded twin-width

We give essentially tight bounds for, ν(d,k), the maximum number of dist...
research
04/24/2021

Width Transfer: On the (In)variance of Width Optimization

Optimizing the channel counts for different layers of a CNN has shown gr...
research
06/23/2023

A Proof of the Weak Simplex Conjecture

We solve a long-standing open problem about the optimal codebook structu...
research
05/08/2023

Shote note:Revisiting Linear Width: Rethinking the Relationship Between Single Ideal and Linear Obstacle

Linear-width is a well-known and highly regarded graph parameter. The co...

Please sign up or login with your details

Forgot password? Click here to reset