Sparse domination modulo polynomials

Abstract

We develop a sparse domination theory that captures both local polynomial approximation and cancellation of the input below the scale of each sparse cube. Its coefficients are percentiles of localized smooth maximal functions of the input minus its local polynomial approximation, combining features of mean-oscillation sparse bounds and of the cancellative sparse bounds of Conde-Alonso, Lorist and Rey. Using wavelet representations, we characterize the Calderón-Zygmund operators whose derivatives admit these bounds by explicit polynomial testing conditions. In the homogeneous setting, the same conditions characterize weighted Hardy-Sobolev inequalities with linear dependence on the A_∞ characteristic. This quantitative dependence detects the transition from BMO to L^∞ testing conditions that Lerner found for pointwise bounds by Riesz potentials, a distinction that qualitative weighted estimates cannot recover. In the inhomogeneous setting, we prove corresponding weighted inequalities and show that they are strictly weaker than pointwise sparse domination from the second derivative order onward. Consequences include Hardy-Sobolev estimates below the Banach range, sharp weighted Sobolev inequalities, and pointwise bounds by Riesz potentials.

Sparse domination and the bi-parameter Hilbert transform
Bingyang Hu
arXiv3 Oct 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
Sparse domination for q-variation associated with functional calculus
Yanhan Chen
arXiv28 Oct 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
On the Roots of Connected Domination Polynomials
Pingping Shao, Chengye Zhao
arXiv23 Sep 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
Sparse domination and an extended L^p range for the trilinear Hilbert transform
Bingyang Hu
arXiv29 Oct 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv
On the Fractional Parts of Polynomials Modulo p
Xuejun Guo, Chen Lin, Zhefeng Xu
arXiv31 Aug 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv

Cite

BibTeX RIS

BibTeX

@misc{plinio2026sparse,
  title = {{Sparse domination modulo polynomials}},
  author = {Francesco Di Plinio},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09771},
  eprint = {2610.09771},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09771},
}

RIS

TY  - UNPB
TI  - Sparse domination modulo polynomials
AU  - Francesco Di Plinio
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.09771
UR  - https://arxiv.org/abs/2610.09771
AB  - We develop a sparse domination theory that captures both local polynomial approximation and cancellation of the input below the scale of each sparse cube. Its coefficients are percentiles of localized smooth maximal functions of the input minus its local polynomial approximation, combining features of mean-oscillation sparse bounds and of the cancellative sparse bounds of Conde-Alonso, Lorist and Rey. Using wavelet representations, we characterize the Calderón-Zygmund operators whose derivatives admit these bounds by explicit polynomial testing conditions. In the homogeneous setting, the same conditions characterize weighted Hardy-Sobolev inequalities with linear dependence on the A_∞ characteristic. This quantitative dependence detects the transition from BMO to L^∞ testing conditions that Lerner found for pointwise bounds by Riesz potentials, a distinction that qualitative weighted estimates cannot recover. In the inhomogeneous setting, we prove corresponding weighted inequalities and show that they are strictly weaker than pointwise sparse domination from the second derivative order onward. Consequences include Hardy-Sobolev estimates below the Banach range, sharp weighted Sobolev inequalities, and pointwise bounds by Riesz potentials.
ER  -

Abstract

Related

Cite