Lower Bounds for Sums of Powers of Low Degree Univariates
نویسندگان
چکیده
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Ω (√ d t ) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials.
منابع مشابه
Volumes of Nonnegative Polynomials, Sums of Squares and Powers of Linear Forms
We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient dimension) of compact sections of the three cones. We show that the bounds are asymptotically exact if the degree is fixed and number of variables tends to infinit...
متن کاملLower Bounds by Birkhoff Interpolation
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor. Previous lower bounds for this problem were only of order Ω( √...
متن کاملWaring’s Problem for Polynomials in Two Variables
We prove that all polynomials in several variables can be decomposed as the sums of kth powers: P (x1, . . . , xn) = Q1(x1, . . . , xn) + · · ·+Qs(x1, . . . , xn), provided that elements of the base field are themselves sums of kth powers. We also give bounds for the number of terms s and the degree of the Qi . We then improve these bounds in the case of two variables polynomials of large degre...
متن کاملar X iv : 1 50 4 . 01 65 6 v 1 [ cs . C C ] 7 A pr 2 01 5 Tight Size - Degree Bounds for Sums - of - Squares Proofs ∗
We exhibit families of 4-CNF formulas over n variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) d but require SOS proofs of size n for values of d = d(n) from constant all the way up to n for some universal constant δ. This shows that the n running time obtained by using the Lasserre semidefinite programming relaxations to find degree-d SOS proofs is op...
متن کاملOn Lower Bounds on the Size of Sums-of-Squares Formulas
For sums of squares formulas of the form (x1 + · · · + xr)(y 1 + · · · + y s) = z 1 + · · · + z t where the zi are bilinear functions of the xi and yi, we have two wellknown lower bounds on the size of t given r and s. One was obtained independently by Hopf and Stiefel, and another by Atyiah. These bounds are given by requiring certain binomial coefficients be divisible by certain powers of 2. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015