Sharp bounds for non-adaptive randomized approximation of high-dimensional vectors
arXiv:2608.00148v2 Announce Type: replace Abstract: We study the complexity of approximating the finite-dimensional vector space embedding $\ell_p^m \hookrightarrow \ell_q^m$ for $2 \leq p