For a polynomial P mapping the integers into the integers, define an averaging operator ANf(x):=1N∑k=1Nf(x+P(k)) acting on functions on the integers. We prove sufficient conditions for the ℓp-improving inequality ‖ANf‖ℓq(Z)≲P,p,qN-d(1p-1q)‖f‖ℓp(Z),N∈N,where 1 ≤ p≤ q≤ ∞. For a range of quadratic polynomials, the inequalities established are sharp, up to the boundary of the allowed pairs of (p, q). For degree three and higher, the inequalities are close to being sharp. In the quadratic case, we appeal to discrete fractional integrals as studied by Stein and Wainger. In the higher degree case, we appeal to the Vinogradov Mean Value Theorem, recently established by Bourgain, Demeter, and Guth
In this thesis, we investigate various topics regarding the arithmetic of polynomials over finite fi...
AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best dis...
AbstractLet {Xn}∞0be the orthonormal system of Legendre polynomials on [−1, 1]. Forf∈C[−1, 1] letSn(...
We apply Christ’s method of refinements to the ℓ^p-improving problem for discrete averages AN along ...
AbstractWe present a new family of linear discrete polynomial operators giving a Timan type approxim...
AbstractA discrete, positive, weighted algebraic polynomial operator which is based on Gaussian quad...
A discrete, positive, weighted algebraic polynomial operator which is based on Gaussian quadrature i...
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebra...
Consider averages along the prime integers P given by ANf(x)=N-1 p:p≤N(logp)f(x-p). A N f(x) = {N-1*...
AbstractGiven a system of polynomial equations over a finite field, estimating the p-divisibility of...
In this manuscript we provide necessary and sufficient conditions for the weak( 1, p) boundedness, 1...
AbstractFor any continuous function f:[−1, 1]↦C and any p∈(0, ∞), let ‖f‖p≔(2−1∫1−1|f(x)|pdx)1/p; in...
summary:There are many inequalities measuring the deviation of the average of a function over an int...
We prove the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three. This ...
AbstractLet f(z) be a continuous function defined on the compact set K⊂C and let En(f)=En(f,K) be th...
In this thesis, we investigate various topics regarding the arithmetic of polynomials over finite fi...
AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best dis...
AbstractLet {Xn}∞0be the orthonormal system of Legendre polynomials on [−1, 1]. Forf∈C[−1, 1] letSn(...
We apply Christ’s method of refinements to the ℓ^p-improving problem for discrete averages AN along ...
AbstractWe present a new family of linear discrete polynomial operators giving a Timan type approxim...
AbstractA discrete, positive, weighted algebraic polynomial operator which is based on Gaussian quad...
A discrete, positive, weighted algebraic polynomial operator which is based on Gaussian quadrature i...
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebra...
Consider averages along the prime integers P given by ANf(x)=N-1 p:p≤N(logp)f(x-p). A N f(x) = {N-1*...
AbstractGiven a system of polynomial equations over a finite field, estimating the p-divisibility of...
In this manuscript we provide necessary and sufficient conditions for the weak( 1, p) boundedness, 1...
AbstractFor any continuous function f:[−1, 1]↦C and any p∈(0, ∞), let ‖f‖p≔(2−1∫1−1|f(x)|pdx)1/p; in...
summary:There are many inequalities measuring the deviation of the average of a function over an int...
We prove the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three. This ...
AbstractLet f(z) be a continuous function defined on the compact set K⊂C and let En(f)=En(f,K) be th...
In this thesis, we investigate various topics regarding the arithmetic of polynomials over finite fi...
AbstractFor the given data (wi,xi,yi), i=1,…,M, we consider the problem of existence of the best dis...
AbstractLet {Xn}∞0be the orthonormal system of Legendre polynomials on [−1, 1]. Forf∈C[−1, 1] letSn(...