Dimensionally Exponential Lower Bounds on the LpL^p Norms of the Spherical Maximal Operator for Cartesian Powers of Finite Trees and Related Graphs

preprint2015arXivOpen access

Abstract

Let TT be a finite tree graph, TNT^N be the Cartesian power graph of TT, and dNd^N be the graph distance metric on TNT^N. Also let SrN(x):={v∈TN:dN(x,v)=r} \mathbb S_r^N(x) := \{v \in T^N: d^N(x,v) = r\} be the sphere of radius rr centered at xx and MM be the spherical maximal averaging operator on TNT^N given by Mf(x):=sup⁡r≥0SrN(x)≠∅1∣SrN(x)∣∣∑SrN(x)f(y)∣. Mf(x) := \sup_{\substack{r \geq 0 \\ \mathbb S_r^N(x) \neq \emptyset}} \frac{1}{|\mathbb S_r^N(x)|} |\sum_{\mathbb S_r^N(x)} f(y)|. We will show that for any fixed 1≤p≤∞1 \leq p \leq \infty, the LpL^p operator norm of MM, i.e. ∥M∥p:=sup⁡∥f∥p=1∥Mf∥p, \|M\|_p := \sup_{\|f\|_p = 1} \|Mf\|_p, grows exponentially in the dimension NN. In particular, if rr is the probability that a random vertex of TT is a leaf, then ∥M∥p≥r−N/p\|M\|_p \geq r^{-N/p}, although this is not a sharp bound. This exponential growth phenomenon extends to a class of graphs strictly larger than trees, which we will call \emph{global antipode graphs}. This growth result stands in contrast to the work of Greenblatt, Harrow, Kolla, Krause, and Schulman that proved that the spherical maximal LpL^p bounds (for p>1p > 1) are dimension-independent for finite cliques.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.