Sparse Bounds for Discrete Maximal Functions associated with Birch-Magyar averages

Abstract

In this article, we study discrete maximal function associated with the Birch-Magyar averages over sparse sequences. We establish sparse domination principle for such operators. As a consequence, we obtain p-estimates for such discrete maximal function over sparse sequences for all p>1. The proof of sparse bounds is based on scale-free p-improving estimates for the single scale Birch-Magyar averages.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…