Related papers: A note on large Kakeya sets

Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

The main goal of this thesis is to study $\mathbb{K}$-uniruled sets that appear in affine geometry. At the beginning we discuss the property of $\mathbb{K}$-uniruledness and its equivalent conditions. Then we bound from above the degree of…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

We give improved lower bounds on the size of Kakeya and Nikodym sets over $\mathbb{F}_q^3$. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in $\mathbb{F}_q^3$, and show that…

Let $K_0$ and $K$ be knots in $\mathbb{R}^3$. Suppose that by a compactly supported Hamiltonian isotopy on $T^*\mathbb{R}^3$, the conormal bundle of $K_0$ is isotopic to a Lagrangian submanifold which intersects the zero section cleanly…

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…

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…

An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can…

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

We show that a certain class of affine hyperplane arrangements are $K(\pi,1)$ by endowing their Falk complexes with an injective metric. This gives new examples of infinite $K(\pi,1)$ arrangements in dimension $n>2$.

Let $\alpha$ be a map from the set of all knot types ${\mathcal K}$ to a set $X$. Let $\beta$ be a map from ${\mathcal K}$ to a set $Y$. We define the relation between $\alpha$ and $\beta$ to be the image of a map $(\alpha,\beta)$ from…

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…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

A finite \emph{$k$-net} of order $n$ is an incidence structure consisting of $k\ge 3$ pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with exactly one…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

We study sets of $\delta$ tubes in $\mathbb{R}^3$, with the property that not too many tubes can be contained inside a common convex set $V$. We show that the union of tubes from such a set must have almost maximal volume. As a consequence,…

I show that $L^{p}-L^{q}$ estimates for the Kakeya maximal function yield lower bounds for the conformal dimension of Kakeya sets, and upper bounds for how much quasisymmetries can increase the Hausdorff dimension of line segments inside…