Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from Boolean variables to variables taking values over the roots of unity. We show that these sums are hard to prove for polynomial calculus and for sum-of-squares, both in terms of degree and size
AbstractLet ζn denote a primitive nth root of unity, n ≥ 4. For any integer k, 2 ≤ k ≤ n − 2 it is s...
International audienceGiven rational univariate polynomials f and g such that gcd(f, g) and f / gcd(...
This dissertation is on sums-of-squares formulas, focusing on whether existence of aformula depends ...
Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from Boolean va...
This paper is a survey of what is known about the magnitude of coeffi-cients appearing in linear rel...
In this note, we discuss a particular family of binomial sums, which can be calculated using simple ...
We present a size-degree trade-off for Sums-of-Squares proofs that is analogous to the previous size...
In Polynomials non-negative on a strip, Murray Marshall proved that every non-negative on the strip ...
A series all of whose coefficients have unit modulus is called an Hadamard square root of unity. We ...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
In the following document I share a particular way to simplify the root of a sum as the sum of roots...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squ...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
The paper gives new bpunds for the length of linear relations among roots of unit
AbstractLet ζn denote a primitive nth root of unity, n ≥ 4. For any integer k, 2 ≤ k ≤ n − 2 it is s...
International audienceGiven rational univariate polynomials f and g such that gcd(f, g) and f / gcd(...
This dissertation is on sums-of-squares formulas, focusing on whether existence of aformula depends ...
Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from Boolean va...
This paper is a survey of what is known about the magnitude of coeffi-cients appearing in linear rel...
In this note, we discuss a particular family of binomial sums, which can be calculated using simple ...
We present a size-degree trade-off for Sums-of-Squares proofs that is analogous to the previous size...
In Polynomials non-negative on a strip, Murray Marshall proved that every non-negative on the strip ...
A series all of whose coefficients have unit modulus is called an Hadamard square root of unity. We ...
The sum of square roots problem over integers is the task of deciding the sign of a \emphnon-zero} s...
In the following document I share a particular way to simplify the root of a sum as the sum of roots...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
We show that if a system of degree-k polynomial constraints on n Boolean variables has a Sums-of-Squ...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
The paper gives new bpunds for the length of linear relations among roots of unit
AbstractLet ζn denote a primitive nth root of unity, n ≥ 4. For any integer k, 2 ≤ k ≤ n − 2 it is s...
International audienceGiven rational univariate polynomials f and g such that gcd(f, g) and f / gcd(...
This dissertation is on sums-of-squares formulas, focusing on whether existence of aformula depends ...