{"id":"openai-math/Subpolynomial-dimension-reduction-in-Lp","pdf":"https://github.com/openai/math/blob/main/preprints/Subpolynomial-dimension-reduction-in-Lp-September-23-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/Subpolynomial-dimension-reduction-in-Lp-September-23-2026","tags":["metric-embeddings","dimension-reduction","lp-spaces","geometry"],"score":0,"title":"Subpolynomial dimension reduction in Lp","domain":"Convex and metric geometry","family":"094","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.MG","summary":"For every fixed $`1\\lt p\\lt \\infty`$ and D > 1, every n -point subset of a real L p space embeds into $`\\ell_p^d`$ with distortion at most D and subpolynomial dimension $`d=n^{o(1)}`$. The target has the same exponent p , and the embedding need not be linear.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-09-23","reactions":{},"formalized":true,"family_title":"Subpolynomial dimension reduction in L p"}