加载中…
We give new lower bounds for the Hausdorff dimension of Kakeya sets built from various families of curves in , 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 -Kakeya sets.

生成讲解博客的中文版本

生成AI智能校验的中文版本