Derandomization and absolute reconstruction for sums of powers of linear forms
Pascal Koiran, Mateusz Skomra

TL;DR
This paper presents a polynomial-time algebraic algorithm for decomposing degree-3 homogeneous polynomials into sums of cubes of linearly independent linear forms, advancing the computational methods in polynomial decomposition.
Contribution
It introduces a novel algebraic, non-factorization-based algorithm for polynomial decomposition with polynomial-time complexity over the rationals, and extends to real numbers.
Findings
Algorithm performs only arithmetic operations and equality tests.
Runs in polynomial time for rational coefficients.
Provides derandomization results for related algebraic problems.
Abstract
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be written as a sum of cubes of linearly independent linear forms with complex coefficients. Compared to previous algorithms for the same problem, the two main novel features of this algorithm are: (i) It is an algebraic algorithm, i.e., it performs only arithmetic operations and equality tests on the coefficients of the input polynomial. In particular, it does not make any appeal to polynomial factorization. (ii) For an input polynomial with rational coefficients, the algorithm runs in polynomial time when implemented in the bit model of computation. The algorithm relies on methods from linear and multilinear algebra (symmetric tensor decomposition by…
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.
