4 papers · 1 filter
Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds
Will Burstein, Alex Iosevich, Ben Krause
We give a self-contained proof of Bourgain's finite selection theorem with an explicit probability bound. For every and , given pairwise orthogonal function…
Endpoint Estimates for Stein's Purely Quadratic Carleson Operator
Anastasios Fragkos, Ben Krause, Michael Lacey
We study the near behavior of the maximally quadratically modulated Hilbert transform \[ \mathcal{C}_2f(x) := \sup_λ \left|\operatorname{p.v.} \int_{\mathbb{R}}f(x-y)e^{2 πi…
A Variation Norm Carleson Theorem Along the Primes
Anastasios Fragkos, Ben Krause, Nazar Miheisi +1
Let denote the von Mangoldt function; we prove that for each , there exist constants \[ r' < \mathbf{c}(r) < 2 < \mathbf{C}(r), \qquad \lim_{r \to \infty} \mathbf{c}(r)…
An Approach To Endpoint Problems in Oscillatory Singular Integrals
Alex Iosevich, Ben Krause, Hamed Mousavi
In this note we provide a quick proof that maximal truncations of oscillatory singular integrals are bounded from to . The methods we us…