2000 character limit reached
A Note on John Simplex with Positive Dilation
Published 7 Dec 2020 in math.MG and cs.LG | (2012.03427v1)
Abstract: We prove a Johns theorem for simplices in $Rd$ with positive dilation factor $d+2$, which improves the previously known $d2$ upper bound. This bound is tight in view of the $d$ lower bound. Furthermore, we give an example that $d$ isn't the optimal lower bound when $d=2$. Our results answered both questions regarding Johns theorem for simplices with positive dilation raised by \cite{leme2020costly}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.