2000 character limit reached
New curved Kakeya estimates
Published 20 Mar 2025 in math.CA | (2503.15760v1)
Abstract: We give new lower bounds for the Hausdorff dimension of Kakeya sets built from various families of curves in $\mathbb R3$, going beyond what the polynomial partitioning method has so-far achieved. We do this by combining Wolff's classical hairbrush argument with a new incidence bound for 3-parameter families of curves which satisfy conditions we call coniness and twistiness. Our main argument builds off a technique of Katz, Wu, and Zahl used in the study of $\rm{SL}_2$-Kakeya sets.
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.