Hausdorff dimension of restricted Kakeya sets

A Kakeya set in \mathbb{R}^{n} is a compact set that contains a unit line segment I_{e} in each direction e \in S^{n-1} . The Kakeya conjecture states that any Kakeya set in \mathbb{R}^{n} has Hausdorff dimension n . We consider a restricted case where the midpoint of each line segment I_{e} must belong to a fixed set A with packing dimension at most s \in [0, n] . In this case, we first show that the Hausdorff dimension of the Kakeya set is at least n - s . Furthermore, using Bourgain’s bush argument, we improve the lower bound to \max \{n - s, n - g_{n}(s)\} , where g_{n}(s) is defined inductively. For example, when n = 4 , we prove that the Hausdorff dimension is at least \max\{\frac{19}{5}- \frac{3}{5}s,4-s\} . We also establish Kakeya maximal function analogues of these results.

Authors

Institutions

Publication Details

Journal
Journal of Fractal Geometry Mathematics of Fractals and Related Topics
Published
2026-11-18
DOI
https://doi.org/10.4171/jfg/199
Citations
1
Primary Topic
Advanced Harmonic Analysis Research
Type
article
Field-Weighted Citation Impact
1.43
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Hausdorff dimension of restricted Kakeya sets

Jonathan M. Fraser, Lijian Yang
1 citations
Journal of Fractal Geometry Mathematics of Fractals and Related Topics
Advanced Harmonic Analysis Research
1.43
article

Hausdorff dimension of restricted Kakeya sets

Jonathan M. Fraser, Lijian Yang
article en
1 citations

Abstract

A Kakeya set in \mathbb{R}^{n} is a compact set that contains a unit line segment I_{e} in each direction e \in S^{n-1} . The Kakeya conjecture states that any Kakeya set in \mathbb{R}^{n} has Hausdorff dimension n . We consider a restricted case where the midpoint of each line segment I_{e} must belong to a fixed set A with packing dimension at most s \in [0, n] . In this case, we first show that the Hausdorff dimension of the Kakeya set is at least n - s . Furthermore, using Bourgain’s bush argument, we improve the lower bound to \max \{n - s, n - g_{n}(s)\} , where g_{n}(s) is defined inductively. For example, when n = 4 , we prove that the Hausdorff dimension is at least \max\{\frac{19}{5}- \frac{3}{5}s,4-s\} . We also establish Kakeya maximal function analogues of these results.

Journal of Fractal Geometry Mathematics of Fractals and Related Topics
University of St Andrews (GB)
Openalex Percentile: Top 28%
Advanced Harmonic Analysis Research
1.43
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon