The maximal degree-one resonant Carleson-Radon transform CR^*_V is L^p-bounded for 1<p<∞ in all dimensions D≥1 when V admits a nontrivial perpendicular vector in the first D coordinates.
Carleson Operators on Doubling Metric Measure Spaces
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
LeanMarathon uses four contract-scoped agents on an evolving blueprint coordinated by a two-stage orchestrator to formalize seven theorems from Erdős problems in Lean, proving 258 lemmas with no sorry across three runs.
A minimal agentic system achieves competitive performance in automated theorem proving with a simpler design and lower cost than state-of-the-art methods.
citing papers explorer
-
On the resonant Carleson-Radon transform in all dimensions. The degree one resonant case
The maximal degree-one resonant Carleson-Radon transform CR^*_V is L^p-bounded for 1<p<∞ in all dimensions D≥1 when V admits a nontrivial perpendicular vector in the first D coordinates.
-
LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization
LeanMarathon uses four contract-scoped agents on an evolving blueprint coordinated by a two-stage orchestrator to formalize seven theorems from Erdős problems in Lean, proving 258 lemmas with no sorry across three runs.
-
A Minimal Agent for Automated Theorem Proving
A minimal agentic system achieves competitive performance in automated theorem proving with a simpler design and lower cost than state-of-the-art methods.