Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA sharp bound for the Stein-Wainger oscillatory integral
149
0
0.0
(
0
)
Authors
Ioannis Parissis
Ask ChatGPT about the research
No Arabic abstract
Let Pd denote the space of all real polynomials of degree at most d. It is an old result of Stein and Wainger that for every polynomial P in Pd: |p.v.int_R {e^{iP(t)} dt/t} | < C(d) for some constant C(d) depending only on d. On the other hand, Carbery, Wainger and Wright claim that the true order of magnitude of the above principal value integral is log d. We prove this conjecture.
rate research
Read More
The relationship between the operator norms of fractional integral operators acting on weighted Lebesgue spaces and the constant of the weights is investigated. Sharp boundsare obtained for both the fractional integral operators and the associated fractional maximal functions. As an application improved Sobolev inequalities are obtained. Some of the techniques used include a sharp off-diagonal version of the extrapolation theorem of Rubio de Francia and characterizations of two-weight norm inequalities.
We provide elementary proofs for the terms that are left in the work of Kelly Bickel, Sandra Pott, Maria C. Reguera, Eric T. Sawyer, Brett D. Wick who proved the sharp weighted $A_2$ bound for Haar shifts and Haar multiplier. Our proofs use weighted square function estimate, Carleson embedding and Wilsons system.
In this paper, we prove $L^p$ decay estimates for multilinear oscillatory integrals in $mathbb{R}^2$, establishing sharpness through a scaling argument. The result in this paper is a generalization of the previous work by Gressman and Xiao (2016).
We propose a new method of estimating oscillatory integrals, which we call a stationary set method. We use it to obtain the sharp convergence exponents of Tarrys problems in dimension two for every degree $kge 2$. As a consequence, we obtain sharp Fourier extension estimates for a family of monomial surfaces.
For $m, d in {mathbb N}$, a jittered sampling point set $P$ having $N = m^d$ points in $[0,1)^d$ is constructed by partitioning the unit cube $[0,1)^d$ into $m^d$ axis-aligned cubes of equal size and then placing one point independently and uniformly at random in each cube. We show that there are constants $c ge 0$ and $C$ such that for all $d$ and all $m ge d$ the expected non-normalized star discrepancy of a jittered sampling point set satisfies [c ,dm^{frac{d-1}{2}} sqrt{1 + log(tfrac md)} le {mathbb E} D^*(P) le C, dm^{frac{d-1}{2}} sqrt{1 + log(tfrac md)}.] This discrepancy is thus smaller by a factor of $Thetabig(sqrt{frac{1+log(m/d)}{m/d}},big)$ than the one of a uniformly distributed random point set of $m^d$ points. This result improves both the upper and the lower bound for the discrepancy of jittered sampling given by Pausinger and Steinerberger (Journal of Complexity (2016)). It also removes the asymptotic requirement that $m$ is sufficiently large compared to $d$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
