Searcharxiv⌕ Search

arXiv · 2609.12440

The norm of the centered Hardy--Littlewood maximal operator

Abstract

We determine the exact $L^p(\mathbb{R})$ norm of the centered Hardy--Littlewood maximal operator for every $1<p<\infty$, proving that it equals $p/(p-1)$. This settles the sharp strong-type problem for the centered maximal operator on the real line. For every $p$ in this range, the norm is strictly larger than the constant associated with the critical power $|x|^{-1/p}$, thereby disproving the conjecture of Dror, Ganguli, and Strichartz that this profile determines the unrestricted norm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José Madrid. 2026-09-11. The norm of the centered Hardy--Littlewood maximal operator. https://arxiv.org/abs/2609.12440

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A discussion of two arguments related to Fefferman's Fourier extension theorem in the plane

The Fourier extension conjecture of E. Stein was proved in the plane in 1970 by C. Fefferman, see also Zygmund and Carleson and Sjölin, with simplifications given by other authors later on, in particular by L. Hörmander and T. Tao. We discuss yet two more arguments for this classical theorem on the parabola. The first argument uses C. Fefferman's decoupling together with a decomposition into Haar wavelets. This sets the stage for the second argument whose point of departure is the bilinear characterization of Tao, Vargas and Vega, and relies on the bilinear interplay with the classical wave packet constructions and discrete characterizations with an induction on scales. Each of the above two arguments rely on some form of Fefferman's convolution decoupling and the special nature of the critical planar index 4 as a positive even integer, but the second might be more amenable to weighted generalizations.

math.CA↗

Turán problem on the union of three intervals of equal length

This paper addresses the Turán extremal problem on the symmetric three-interval set $Ω_λ= (-1,1) \cup (λ-1,λ+1) \cup (-λ-1,-λ+1)$, $λ\geq 0$. We establish a discrete approximation principle relating the continuous Turán problem on $Ω_λ$ to the discrete Turán problem on an associated finite discrete set. This enables the continuous problem to be exactly expressed as a limit of finite nonnegative trigonometric polynomial problems, which are equivalent to finite semidefinite programs. Using this framework, we compute the Turán constant for integer and rational parameters $λ$. We further analyze the dependence of the Turán constant on $λ$ and derive upper bounds for all $λ> 5$.

math.CA↗