Maximal subspace averages

Abstract: We study maximal operators associated to singular averages along finite subsets

S i g m a

of the Grassmannian

m a t h r m G r (d, n)

of

d

-dimensional subspaces of

m a t h b b R^{n}

. The well studied

d = 1

case corresponds to the the directional maximal function with respect to arbitrary finite subsets of

m a t h r m G r (1, n) = m a t h b b S^{n - 1}

. We provide a systematic study of all cases

1 l e q d < n

and prove essentially sharp

L^{2} (m a t h b b R^{n})

bounds for the maximal subspace averaging operator in terms of the cardinality of

S i g m a

, with no assumption on the structure of

S i g m a

. In the codimension

1

case, that is

n = d + 1

, we prove the precise critical weak

(2, 2)

-bound. Drawing on the analogy between maximal subspace averages and

(d, n)

-Nikodym maximal averages, we also formulate the appropriate maximal Nikodym conjecture for general

1 < d < n

by providing examples that determine the critical

L^{p}

-space for the

(d, n)

-Nikodym problem. Unlike the

d = 1

case, the maximal Kakeya and Nikodym problems are shown not to be equivalent when

d > 1

. In this context, we prove the best possible

L^{2} (m a t h b b R^{n})

-bound for the

(d, n)

-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

d

-dimensional plates in

m a t h b b R^{n}

.

This page was built for publication: Maximal subspace averages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6372024)