Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sparse bounds for discrete singular Radon transforms

Published 8 Nov 2019 in math.CA | (1911.03006v2)

Abstract: We show that discrete singular Radon transforms along a certain class of polynomial mappings $P:\mathbb{Z}d\to \mathbb{Z}n$ satisfy sparse bounds. For $n=d=1$ we can handle all polynomials. In higher dimensions, we pose restrictions on the admissible polynomial mappings stemming from a combination of interacting geometric, analytic and number-theoretic obstacles.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.