2000 character limit reached
Sparse bounds for discrete singular Radon transforms (1911.03006v2)
Published 8 Nov 2019 in math.CA
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.