Sharp inequalities for maximal operators on finite graphs, II
Cristian Gonz\'alez-Riquelme, Jos\'e Madrid

TL;DR
This paper investigates sharp inequalities for maximal operators on finite graphs and the integers, providing explicit limits, constants, and extremizers for various cases and parameters.
Contribution
It derives exact limits, constants, and extremizers for maximal operators on specific finite graphs and on integers, extending the understanding of their behavior.
Findings
Limit of the operator norm on star and complete graphs as p→∞
Exact value of the best constant for variance inequalities on star graphs
Explicit extremizers for maximal operators on graphs and integers
Abstract
Let be the centered Hardy-Littlewood maximal operator on a finite graph . We find when is the start graph () and the complete graph (), and we fully describe and the corresponding extremizers for . We prove that when . Also, we compute the best constant such that for every we have . We prove that for all and characterize the extremizers. Moreover, when is the Hardy-Littlewood maximal operator on , we compute the best constant such that for and we describe the extremizers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Spectral Theory in Mathematical Physics · Nonlinear Partial Differential Equations
