Dimension-dependent improvement of the lower bound
Establish an improved lower bound for d_GH(B^m,B^n) that depends on both the higher dimension m and the lower dimension n, thereby capturing the expected increase in geometric dissimilarity as the dimensional difference grows.
References
Can one establish an improved version of Theorem~\ref{thm:general} that is a function of both $m$ and $n$?
Can the methods developed in this paper be extended to bound $d_GH(Bm_p, Bn_p)$ for $\ellp$ unit balls Bn_p = \left{x \in n : \left(\sum_{i=1}n |x_i|p\right){1/p} \leq 1\right} for $1\le p \leq \infty$? Or to ellipsoids ${x \in n : xT A x \leq 1}$ for positive definite matrices $A \neq I$? Since these sets are centrally symmetric ($x \in B$ implies $-x \in B$), what do Borsuk--Ulam approaches yield in this setting?
For $n=2$, we conjecture that the configuration that minimizes the distance to $M_4$ places points at $(\pm c,0)$ and $(0,\pm c)$ in $B2$ for $c=\frac{2\sqrt\frac{8}{3}{2+\sqrt{2} \approx0.9566$, which (if true) would yield that $d_GH(B3,B2)$ is at least as large as $\tfrac{1}{2}d(M_4,K_4(B2)){= }\tfrac{1}{2}\lvert\sqrt{\tfrac{8}{3}-2c\rvert \approx0.1401$.