Metraipolis › archive › dc_2535ed6cfb2f
Low-Degree Polynomial Approximation of the Cross-Polytope — arXiv:2609.17614
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.17614
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T17:09:17.693Z
- SHA-256 of the archived text
6983d1f1e015a067ba84c7717f26133b06b39cc3addc3aacdf9e4a737abe3591- Stable URL of this page
https://metraipolis.com/documento/dc_2535ed6cfb2f
How to cite
Low-Degree Polynomial Approximation of the Cross-Polytope — arXiv:2609.17614 — arXiv (en), https://arxiv.org/abs/2609.17614 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2535ed6cfb2f (Metraipolis archive dc_2535ed6cfb2f, sha256 6983d1f1e015a067ba84c7717f26133b06b39cc3addc3aacdf9e4a737abe3591)
BibTeX
@misc{dc2535ed6cfb2f,
title = {Low-Degree Polynomial Approximation of the Cross-Polytope — arXiv:2609.17614},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.17614},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2535ed6cfb2f; sha256 6983d1f1e015a067ba84c7717f26133b06b39cc3addc3aacdf9e4a737abe3591},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17614. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the degree-distortion tradeoff for polynomial approximation of the $d$-dimensional cross-polytope $B_1^d$. For every $1\le t\le d$, every globally nonnegative degree-$2t$ form that is positive away from the origin has multiplicative sandwich distortion at least $(2e)^{-1/2}\sqrt{d/t}$, while an explicit sum-of-squares (SoS) form achieves distortion at most $(2e)^{1/2}\sqrt{d/t}$. Hence both the nonnegative-form and SoS optima are $\Theta(\sqrt{d/t})$, and degree $\Theta(d)$ is necessary and sufficient for constant distortion. The lower bound is representation-free. Averaging over signed permutations and evaluating on flat points of the $\ell_1$ sphere reduces every candidate to a support-size profile $V(k)=k^{-2t}Q(k)$ with $°Q\le t$ and $Q(0)=0$. After the substitution $u=1/k$, Lagrange interpolation shows that this degree budget cannot keep the profile nearly constant across $d$ support scales. A matching SoS construction averages even powers of sign-vector facet normals and reduces the upper bound to a Rademacher moment. We also isolate a weighted reciprocal-grid lemma, derive consequences for $\ell_p$ balls, and contrast the polar cube. For a general symmetric polytope, weighted facet powers yield a one-sided certificate whose boundary-floor objective is concave and whose worst-direction oracle reduces to convex dual-norm problems; at degree two, its optimizers recover classical optimal design and the John ellipsoid. This is an oracle-model certificate optimization, not an end-to-end complexity result or a characterization of the full SoS optimum.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.17614 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T16:17:15.252Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).