Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 161 tok/s Pro
GPT OSS 120B 412 tok/s Pro
Claude Sonnet 4 35 tok/s Pro
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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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