Best constants for the Hardy-Littlewood maximal operator on finite graphs

preprint2014arXivOpen access

Abstract

We study the behavior of averages for functions defined on finite graphs GG, in terms of the Hardy-Littlewood maximal operator MGM_G. We explore the relationship between the geometry of a graph and its maximal operator and prove that MGM_G completely determines GG (even though embedding properties for the graphs do not imply pointwise inequalities for the maximal operators). Optimal bounds for the pp-(quasi)norm of a general graph GG in the range 0<p≤10<p\le1 are given, and it is shown that the complete graph KnK_n and the star graph SnS_n are the extremal graphs attaining, respectively, the lower and upper estimates. Finally, we study weak-type estimates and some connections with the dilation and overlapping indices of a graph.

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.