中文
相关论文

相关论文: Kakeya books and projections of Kakeya sets

200 篇论文

We pose the following conjecture: (*) If A is the union of line segments in R^n, and B is the union of the corresponding full lines then the Hausdorff dimensions of A and B agree. We prove that this conjecture would imply that every…

度量几何 · 数学 2018-03-12 Tamás Keleti

We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $\epsilon>0$ such…

经典分析与常微分方程 · 数学 2021-03-26 Jonathan M. Fraser , Kota Saito , Han Yu

We study a variety of problems about homothets of sets related to the Kakeya conjecture. In particular, we show many of these problems are equivalent to the arithmetic Kakeya conjecture of Katz and Tao. We also provide a proof that the…

Roughly speaking, the Kakeya Conjecture asks to what extent lines which point in different directions can be packed together in a small space. In $\R^2$, the problem is relatively straightforward and was settled in the 1970s. In $\R^3$ it…

经典分析与常微分方程 · 数学 2025-12-11 Jonathan Hickman

We prove the Kakeya set conjecture for $\mathbb{Z}/N\mathbb{Z}$ for general $N$ as stated by Hickman and Wright [HW18]. This entails extending and combining the techniques of Arsovski [Ars21a] for $N=p^k$ and the author and Dvir [DD21] for…

组合数学 · 数学 2024-01-11 Manik Dhar

We define Kakeya sets in the Heisenberg group and show that the Heisenberg Hausdorff dimension of Kakeya sets in the first Heisenberg group is at least 3. This lower bound is sharp since, under our definition, the $\{xoy\}$-plane is a…

经典分析与常微分方程 · 数学 2021-06-29 Jiayin Liu

We consider unions of $SL(2)$ lines in $\mathbb{R}^{3}$. These are lines of the form $$L = (a,b,0) + \mathrm{span}(c,d,1),$$ where $ad - bc = 1$. We show that if $\mathcal{L}$ is a Kakeya set of $SL(2)$ lines, then the union $\cup…

经典分析与常微分方程 · 数学 2022-10-19 Katrin Fässler , Tuomas Orponen

A Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and…

组合数学 · 数学 2019-06-05 Audie Warren , Arne Winterhof

A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the…

组合数学 · 数学 2015-05-13 Zeev Dvir

A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…

组合数学 · 数学 2020-03-20 Maarten De Boeck , Geertrui Van de Voorde

In a recent paper of Ellenberg, Oberlin, and Tao, the authors asked whether there are Besicovitch phenomena in F_q[[t]]^n. In this paper, we answer their question in the affirmative by explicitly constructing a Kakeya set in F_q[[t]]^n of…

组合数学 · 数学 2014-01-14 Evan P. Dummit , Márton Hablicsek

This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much…

信息论 · 计算机科学 2026-03-27 Nicholas G. Polson , Daniel Zantedeschi

We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set…

计算复杂性 · 计算机科学 2016-12-02 Jack H. Lutz , Neil Lutz

We show that, almost surely, the Hausdorff dimension $s_0$ of a random covering set is preserved under all orthogonal projections to linear subspaces with dimension $k>s_0$. The result holds for random covering sets with a generating…

经典分析与常微分方程 · 数学 2015-05-11 Changhao Chen , Henna Koivusalo , Bing Li , Ville Suomala

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

数论 · 数学 2010-03-22 Swastik Kopparty , Vsevolod F. Lev , Shubhangi Saraf , Madhu Sudan

The arithmetic Kakeya conjecture, formulated by Katz and Tao in 2002, is a statement about addition of finite sets. It is known to imply a form of the Kakeya conjecture, namely that the upper Minkowski dimension of a Besicovitch set in…

数论 · 数学 2017-12-07 Ben Green , Imre Ruzsa

First, we study constructible subsets of $\A^n_k$ which contain a line in any direction. We classify the smallest such subsets in $\A^3$ of the type $R\cup\{g\neq 0\},$ where $g\in k[x_1,...,x_n]$ is irreducible of degree $d$, and $R\subset…

代数几何 · 数学 2014-10-17 Kaloyan Slavov

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

组合数学 · 数学 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

Katz and Zahl used a planebrush argument to prove that Kakeya sets in $\mathbb{R}^4$ have Hausdorff dimension at least 3.059. In the special case when the Kakeya set is plany, their argument gives a better lower bound of 10/3. We give a…

经典分析与常微分方程 · 数学 2026-01-13 Izabella Łaba , Mukul Rai Choudhuri , Joshua Zahl

We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization…

组合数学 · 数学 2014-09-04 Ruixiang Zhang