$\ell^p$-improving inequalities for Discrete Spherical Averages
Robert Kesler, Michael T. Lacey

TL;DR
This paper establishes $ ext{ell}^p$-improving inequalities for discrete spherical averages on integer lattices in dimensions five and higher, extending classical continuous results to a discrete setting with prime factor considerations.
Contribution
It introduces new $ ext{ell}^p$-improving bounds for discrete spherical averages, incorporating prime factor dependence, and adapts continuous inequalities to the lattice setting.
Findings
Proved $ ext{ell}^p$-improving bounds for $A_ ext{lambda}$ in dimensions $d extgreater 4$.
Established bounds depend on the number of prime factors of $ ext{lambda}^2$.
Extended classical spherical average inequalities to discrete lattice points.
Abstract
Let , and in dimensions , let denote the average of over the lattice points on the sphere of radius centered at . We prove improving properties of . \begin{equation*} \lVert A_{\lambda }\rVert_{\ell ^{p} \to \ell ^{p'}} \leq C_{d,p, \omega (\lambda ^2 )} \lambda ^{d ( 1-\frac{2}p)}, \qquad \tfrac{d-1}{d+1} < p \leq \frac{d} {d-2}. \end{equation*} It holds in dimension for odd . The dependence is in terms of , the number of distinct prime factors of . These inequalities are discrete versions of a classical inequality of Littman and Strichartz on the improving property of spherical averages on , in particular they are scale free, in a natural sense. The proof uses…
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
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Mathematical Approximation and Integration
