A Note on John Simplex with Positive Dilation
Zhou Lu

TL;DR
This paper proves a tighter upper bound for Johns theorem on simplices with positive dilation in Euclidean space, improving previous bounds and providing new insights into optimal bounds.
Contribution
It establishes a new upper bound of d+2 for simplices with positive dilation, improving the previous d^2 bound, and explores the bounds' tightness.
Findings
Upper bound of d+2 for simplices with positive dilation
The bound is tight based on the d lower bound
Counterexample showing d isn't the optimal lower bound when d=2
Abstract
We prove a Johns theorem for simplices in with positive dilation factor , which improves the previously known upper bound. This bound is tight in view of the lower bound. Furthermore, we give an example that isn't the optimal lower bound when . Our results answered both questions regarding Johns theorem for simplices with positive dilation raised by \cite{leme2020costly}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · graph theory and CDMA systems
