2000 character limit reached
Quantitative Carleson's conjecture for Ahlfors regular domains
Published 15 May 2025 in math.CA and math.AP | (2505.10666v1)
Abstract: In this article, we prove a quantitative version of Carleson's $\varepsilon2$ conjecture in higher dimension: we characterise those Ahlfors-David regular domains in $\mathbb{R}{n+1}$ for which the Carleson's coefficients satisfy the so-called strong geometric lemma.
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.