Search arXiv⌕ Search

arXiv · 2610.37419

Typical Kakeya-type sets and their typical code sets

Abstract

We study properties of compact Besicovitch sets and other Kakeya-type sets which are typical in the sense that the exceptions form a meager set in the Baire category sense in a suitable metric space. The main motivation comes from the known fact that typical compact Besicovitch sets in $\mathbb{R}^n$ have minimal Hausdorff dimension among all Besicovitch sets of $\mathbb{R}^n$. Thus, in order to estimate the smallest possible Hausdorff dimension of an arbitrary Besicovitch set, it is enough to estimate the Hausdorff dimension of a typical (compact) Besicovitch set, or analogously of a Besicovitch set satisfying our list of typical properties. Among other results, we prove that a typical Besicovitch set $K$ in $\mathbb{R}^n$ has the following properties: it is not sticky, any line intersects $K$ in a set of ($1$-dimensional) measure zero or in a unit line segment and a set of measure zero, it has no more than $n$ different unit line segments in any direction, and for each $1\le j\le n$ the Hausdorff dimension of the set of those directions in which $K$ has exactly $j$ unit line segments is $n-j$. For compact metric spaces $X$ and $Y$, let $\mathcal{C}(X,Y)$ denote the set of compact subsets of $X\times Y$ whose projection onto the first coordinate is $X$, equipped with the Hausdorff metric. Kakeya-type compact sets can be coded by elements of such spaces, allowing typical properties to be studied through comeager subsets of $\mathcal C(X,Y)$. Among other results, we prove that, under suitable conditions on $X$ and $Y$, a typical $A\in \mathcal{C}(X,Y)$ is totally disconnected and purely unrectifiable, its projection to the second coordinate has Hausdorff dimension zero, and the dimension identities $\dim_H(A)=\dim_H(X)$ and $\dim_P(A)=\dim_P(X)+\dim Y$ hold.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Josef Bell, Ezekiel Fleissner-Kates, Tamás Keleti. 2026-10-27. Typical Kakeya-type sets and their typical code sets. https://arxiv.org/abs/2610.37419

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Every Extended Metric Space Is Isometrically Embeddable into the Gromov-Hausdorff Class

Let $\mathfrak{GH}$ denote the Gromov--Hausdorff class of isometry classes of nonempty metric spaces, equipped with the Gromov--Hausdorff extended pseudometric. We prove that every nonempty extended metric space is isometrically embeddable into $\mathfrak{GH}$. More precisely, for every nonempty extended metric space $X$, all image points may be represented by metrics on a common set of cardinality $\max\{\operatorname{dens} X,\aleph_0\}$. The main ingredient is a realization theorem for function spaces: for every nonempty set $I$, the space of all real-valued functions on $I$, endowed with the uniform extended metric, can be realized as a family of metrics on a fixed underlying set. Under this realization, the Gromov--Hausdorff distance agrees exactly with the uniform extended distance, including the case of infinite distance. The resulting metric spaces are complete, uniformly discrete, and unbounded, and have cardinality $\max\{|I|,\aleph_0\}$. If $I$ is countable, they may moreover be chosen proper and of bounded geometry. As further consequences, we obtain sharp cardinality results for clouds and universality results for cardinality-restricted parts of $\mathfrak{GH}$ and for spheres in the associated zero-distance quotients.

math.MG↗

New upper bounds for average kissing numbers

A packing of balls in Euclidean space is a set of balls with non-overlapping interiors. For a finite packing of balls, its average contact number is the average number of balls tangent to a ball in this packing, that is, twice the total number of tangencies divided by the number of balls. The average kissing number of the space is defined as the supremum of average contact numbers over all finite ball packings. In this paper, we present a new semidefinite programming approach to average kissing numbers and improve upon known upper bounds in all dimensions \(3\) through \(30\). In particular, we provide the first improvements to the upper bounds in dimensions \(10\) through \(30\) obtained from kissing numbers. We also fully solve the average kissing number problem in dimensions \(8\) and \(24\) by showing that the average kissing numbers coincide with the kissing numbers, 240 and 196560, respectively. These values are limits of average contact numbers of finite subpackings from the \(E_8\) and Leech lattices.

math.MG↗

On surfaces, that fill the space

The article is devoted to the construction of dimension-raising maps of cubes with the highest possible Holder exponent. In particular, a square-to-cube mapping with a Holder exponent of $2/3$ is constructed, which is a solution to the V.I.Arnold problem.

math.MG↗