Related papers: The Inverse Kakeya Problem

The classical Steinhaus theorem (\cite{Steinhaus1920}) says that if $A \subset {\Bbb R}^d$ has positive Lebesgue measure than $A-A=\{x-y: x,y \in A\}$ contains an open ball. We obtain some quantitative lower bounds on the size of this ball…

The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest empty box is of asymptotic order $1/n$ for $n\to\infty$ and…

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

We prove that the Kakeya maximal conjecture is equivalent to the $\Omega$-Kakeya maximal conjecture. This completes a recent result in [2] where Keleti and Math{\'e} proved that the Kakeya conjecture is equivalent to the $\Omega$-Kakeya…

Given a convex polygon $P$ with $k$ vertices and a polygonal domain $Q$ consisting of polygonal obstacles with total size $n$ in the plane, we study the optimization problem of finding a largest similar copy of $P$ that can be placed in $Q$…

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…

We establish a general criterion for the existence of convex sets of fixed shape as, e.g., balls of a given radius, of maximal probability on Banach spaces. We also provide counterexamples showing that their existence my fail even in some…

The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…

In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the $d$-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with $d+2$ vertices…

A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called 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…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

We prove results relative to the problem of finding sharp bounds for the affine invariant $P(K)=V(\Pi K)/V^{d-1}(K)$. Namely, we prove that if $K$ is a 3-dimensional zonoid of volume 1, then its second projection body $\Pi^2K$ is contained…

The famous Minkowski inequality provides a sharp lower bound for the mixed volume $V(K,M[n-1])$ of two convex bodies $K,M\subset\mathbb{R}^n$ in terms of powers of the volumes of the individual bodies $K$ and $M$. The special case where $K$…

We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

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…

A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…