Related papers: The Kakeya problem for circular arcs
In 1971, Davies proved that finitely many parallel line segments can be simultaneously fully rotated in an arbitrarily small area. In this paper we show that an even stronger statement holds: The unit square can be fully rotated in such a…
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…
We say that a planar set $A$ has the Kakeya property if there exist two different positions of $A$ such that $A$ can be continuously moved from the first position to the second within a set of arbitrarily small area. We prove that if $A$ is…
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a…
A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…
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…
The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…
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…
We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…
We construct a compact set in $\mathbb R^2$ of measure 0 containing a piece of a parabola of every aperture between 1 and 2. As a consequence, we improve lower bounds for the $L^p$-$L^q$ norm of the corresponding maximal operator for a…
Let $K$ be a convex body (a compact convex set) in $\mathbb{R}^d$, that contains a copy of another body $S$ in every possible orientation. Is it always possible to continuously move any one copy of $S$ into another, inside $K$? As a…
John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…
In this paper, we study continuous Kakeya line and needle configurations, of both the oriented and unoriented varieties, in connected Lie groups and some associated homogenous spaces. These are the analogs of Kakeya line (needle) sets…
If one is given a rigid triangle in the plane or space, we show that the only motion possible, where each vertex of the triangle moves along a straight line, is given by a hypocycloid line drawer in the plane, and a natural extension in…
We prove that the largest convex shape that can be placed inside a given convex shape $Q \subset \mathbb{R}^{d}$ in any desired orientation is the largest inscribed ball of $Q$. The statement is true both when "largest" means "largest…
We investigate analogues for curves of the Kakeya problem for straight lines. These arise from H"ormander-type oscillatory integrals in the same way as the straight line case comes from the restriction and Bochner-Riesz problems. Using some…
A Kakeya set is a compact subset of $\mathbb{R}^n$ that contains a unit line segment pointing in every direction. The Kakeya conjecture asserts that such sets must have Hausdorff and Minkowski dimension $n$. There is a special class of…
We study arrangements of geodesic arcs on a sphere, where all arcs are internally disjoint and each arc has its endpoints located within the interior of other arcs. We establish fundamental results concerning the minimum number of arcs in…
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…
We show that doubling, linearly connected metric spaces are quasi-arc connected. This gives a new and short proof of a theorem of Tukia.