Open AccessJournal Article
Discrete analogues of Kakeya problems
TL;DR: In this paper, the authors considered discrete analogies of the maximal Kakeya operator conjecture and the recently solved endpoint multilinear kakeya problem, by effectively shrinking the tubes involved in these problems to lines, thus giving rise to the problems of counting joints and multijoints with multiplicities.
read more
Abstract: This thesis investigates two problems that are discrete analogues of two harmonic analytic problems which lie in the heart of research in the field.
More specifically, we consider discrete analogues of the maximal Kakeya operator conjecture and of the recently solved endpoint multilinear Kakeya problem, by effectively shrinking the tubes involved in these problems to lines, thus giving rise to the problems of counting joints and multijoints with multiplicities. In fact, we effectively show that, in $\mathbb{R}^3$, what we expect to hold due to the maximal Kakeya operator conjecture, as well as what we know in the continuous case due to the endpoint multilinear Kakeya theorem by Guth, still hold in the discrete case.
In particular, let $\mathfrak{L}$ be a collection of $L$ lines in $\mathbb{R}^3$ and $J$ the set of joints formed by $\mathfrak{L}$, that is, the set of points each of which lies in at least three non-coplanar lines of $\mathfrak{L}$. It is known that $|J|=O(L^{3/2})$ (first proved by Guth and Katz). For each joint $x\in J$, let the multiplicity $N(x)$ of $x$ be the number of triples of non-coplanar lines through $x$. We prove here that $$\sum_{x\in J} N(x)^{1/2}=O(L^{3/2}), $$while we also extend this result to real algebraic curves in $\mathbb{R}^3$ of uniformly bounded degree, as well as to curves in $\mathbb{R}^3$ parametrized by real univariate polynomials of uniformly bounded degree.
The multijoints problem is a variant of the joints problem, involving three finite collections of lines in $\mathbb{R}^3$; a multijoint formed by them is a point that lies in (at least) three non-coplanar lines, one from each collection.
We finally present some results regarding the joints problem in different field settings and higher dimensions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
On the joints problem with multiplicities
TL;DR: In this article, it was shown that the number of joints, J, can be as big as O(n) if the direction vectors of the lines passing through the lines are linearly independent.
11
•Posted Content
Generalizations of Joints Problem
TL;DR: In this article, the authors generalize the joints problem to sets of varieties and prove an almost sharp bound on the number of joints with multiplicities, where the main tools are polynomial partitioning and induction on dimension.
10
•Posted Content
Counting multijoints
TL;DR: The multijoints problem is a variant of the joints problem, as well as a discrete analogue of the endpoint multilinear Kakeya problem, and the results are extended to multijointeds formed by real algebraic curves in R 3 of uniformly bounded degree.
•Posted Content
Counting joints in vector spaces over arbitrary fields
TL;DR: In this article, the authors give a proof of the "folklore" theorem that the Kaplan-Sharir-Shustin/Quilodr\'an result on counting joints associated to a family of lines holds in vector spaces over arbitrary fields, not just the reals.
9
Incidence bounds on multijoints and generic joints
TL;DR: This work generalises, to all dimensions, a (very small) part of the main point-line incidence theorem in $$\mathbb {R}^3$$R3 by Guth and Katz to the case of multijoints and generic joints formed by real algebraic curves.
References
•Posted Content
On the Erdos distinct distance problem in the plane
Larry Guth,Nets Hawk Katz +1 more
TL;DR: In this paper, it was shown that a set of points in the plane has at least Ω(n 2 ) distinct distances from the center of the plane, and that most of the points lie on a ruled surface.
On lines, joints, and incidences in three dimensions
TL;DR: In this paper, the maximum possible number of incidences between n lines in R^3 and m of their joints (points incident to at least three non-coplanar lines) is shown to be @Q(m^1^/^3n) for m>=n, and @Q (m^2^/+n^2+m+n+n), for m=n.