Add to ORKGThe paper improves a previous lower bound of Schinzel for the number of terms of a power of a polynomial. The improvement is essentially exponential
In this paper, we provide a new bound for exponential sums in one variable. This new bound gives non...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
AbstractIn this paper, we provide a new bound for exponential sums in one variable. This new bound g...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
the paper proves a lower bound for the number of terms of a polynomial which is composite, i.e. of t...
the paper proves a lower bound for the number of terms of a polynomial which is composite, i.e. of t...
Some interesting questions can be posed regarding the maximum number of terms of a polynomial when d...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
AbstractWe improve some lower bounds which have been obtained by Strassen and Lipton. In particular ...
Suppose we are given a polynomial $P(x_{1},\ldots,x_{r})$ in $r \geq 1$ variables, let $m$ bound the...
We develop new polynomial methods for studying systems of word equations. We use them to im-prove so...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
Suppose we are given a polynomial P(x1,…,xr) in r≥1 variables, let m bound the degree of P in all va...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
In this paper, we provide a new bound for exponential sums in one variable. This new bound gives non...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
AbstractIn this paper, we provide a new bound for exponential sums in one variable. This new bound g...
The paper improves a previous lower bound of Schinzel for the number of terms of a power of a polyno...
the paper proves a lower bound for the number of terms of a polynomial which is composite, i.e. of t...
the paper proves a lower bound for the number of terms of a polynomial which is composite, i.e. of t...
Some interesting questions can be posed regarding the maximum number of terms of a polynomial when d...
We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degre...
AbstractWe improve some lower bounds which have been obtained by Strassen and Lipton. In particular ...
Suppose we are given a polynomial $P(x_{1},\ldots,x_{r})$ in $r \geq 1$ variables, let $m$ bound the...
We develop new polynomial methods for studying systems of word equations. We use them to im-prove so...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
Suppose we are given a polynomial P(x1,…,xr) in r≥1 variables, let m bound the degree of P in all va...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
AbstractIn this paper, bounds for exponential sums associated to polynomial ƒ defined over finite fi...
In this paper, we provide a new bound for exponential sums in one variable. This new bound gives non...
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formula...
AbstractIn this paper, we provide a new bound for exponential sums in one variable. This new bound g...