35 research outputs found
Maximal subspace averages
We study maximal operators associated to singular averages along finite
subsets of the Grassmannian of -dimensional
subspaces of . The well studied case corresponds to the the
directional maximal function with respect to arbitrary finite subsets of
. We provide a systematic study of all cases
and prove essentially sharp bounds for the
maximal subspace averaging operator in terms of the cardinality of ,
with no assumption on the structure of . In the codimension case,
that is , we prove the precise critical weak -bound.
Drawing on the analogy between maximal subspace averages and -Nikodym
maximal averages, we also formulate the appropriate maximal Nikodym conjecture
for general by providing examples that determine the critical
-space for the -Nikodym problem. Unlike the case, the maximal
Kakeya and Nikodym problems are shown not to be equivalent when . In this
context, we prove the best possible -bound for the
-Nikodym maximal function for all combinations of dimension and
codimension.
Our estimates rely on Fourier analytic almost orthogonality principles,
combined with polynomial partitioning, but we also use spatial analysis based
on the precise calculation of intersections of -dimensional plates in
.Comment: 40 pages, 1 figure, submitted for publicatio
Linear and multilinear spherical maximal functions
In dimensions n [greater than or equal to] 2 we obtain Lp1(Rn) x ... x Lpm(Rn) to Lp(Rn) boundedness for the multilinear spherical maximal function in the largest possible open set of indices and we provide counterexamples that indicate the optimality of our results. Moreover, we obtain weak type and Lorentz space estimates as well as counterexamples in the endpoint cases. We also study a family of maximal operators that provides a continuous link connecting the Hardy-Littlewood maximal function to the spherical maximal function. Our theorems are proved in the multilinear setting but may contain new results even in the linear case. For this family of operators we obtain bounds between Lebesgue spaces in the optimal range of exponents. Moreover, we provide multidimensional versions of the Kakeya, Nikodym, and Besicovitch constructions associated with a fixed rectifiable set. These yield counterexamples indicating that maximal operators given by translations of spherical averages are unbounded on all Lp(Rn) for p [less than] [infinity]. For lower-dimensional sets of translations, we obtain Lp boundedness for the associated maximally translated spherical averages and for the uncentered spherical maximal functions for a certain range of p that depends on the upper Minkowski dimension of the set of translations. This implies that the Nikodym sets associated with spheres have full Hausdorff dimension.Includes bibliographical references (pages 91-96)
The polynomial method over varieties
Treballs finals del Mà ster en Matemà tica Avançada, Facultat de matemà tiques, Universitat de Barcelona, Any: 2019, Director: MartÃn Sombra[en] In 2010, Guth and Katz introduced the polynomial partitioning theorem as a tool in incidence geometry and in additive combinatorics. This allowed the application of results from algebraic geometry (mainly on intersection theory and on the topology of real algebraic varieties) to the solution of long standing problems, including the celebrated ErdÅ‘s distinct distances problem. Recently, Walsh has extended the polynomial partitioning method to an arbitrary subvariety. This result opens the way to the application of this method to control the point-hypersurface incidences and, more generally, of variety-variety incidences, in spaces of arbitrary dimension.
This final project consists in studying Walsh’s paper, to explain its contents and explore its applications to t his kind of incidence problems