Improved Debordering of Waring Rank
Amir Shpilka

TL;DR
This paper establishes a new upper bound on the Waring rank of a homogeneous polynomial based on its border Waring rank, improving previous bounds significantly and advancing understanding of polynomial decomposition complexity.
Contribution
It proves a tighter upper bound on Waring rank in terms of border Waring rank, refining previous exponential bounds and contributing to polynomial decomposition theory.
Findings
Waring rank is bounded by d * r^{O(√r)} for polynomials with border Waring rank r.
This bound improves upon the previous exponential bounds in r.
The result advances the theoretical understanding of polynomial decomposition complexity.
Abstract
We prove that if a degree- homogeneous polynomial has border Waring rank , then its Waring rank is bounded by \[ {\mathrm{WR}}({f}) \leq d \cdot r^{O(\sqrt{r})}. \] This result significantly improves upon the recent bound established in [Dutta, Gesmundo, Ikenmeyer, Jindal, and Lysikov, STACS 2024], which itself was an improvement over the earlier bound .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Advanced Computational Techniques and Applications
