Best constants for the Hardy-Littlewood maximal operator on finite graphs
Combinatorics
2014-10-24 v1 Classical Analysis and ODEs
Abstract
We study the behavior of averages for functions defined on finite graphs , in terms of the Hardy-Littlewood maximal operator . We explore the relationship between the geometry of a graph and its maximal operator and prove that completely determines (even though embedding properties for the graphs do not imply pointwise inequalities for the maximal operators). Optimal bounds for the -(quasi)norm of a general graph in the range are given, and it is shown that the complete graph and the star graph 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.
Keywords
Cite
@article{arxiv.1410.6204,
title = {Best constants for the Hardy-Littlewood maximal operator on finite graphs},
author = {Javier Soria and Pedro Tradacete},
journal= {arXiv preprint arXiv:1410.6204},
year = {2014}
}