Related papers: Finite field Nikodym problem for spread line sets
A Nikodym set $\mathcal{N}\subseteq(\mathbb{Z}/(N\mathbb{Z}))^n$ is a set containing $L\setminus\{x\}$ for every $x\in(\mathbb{Z}/(N\mathbb{Z}))^n$, where $L$ is a line passing through $x$. We prove that if $N$ is square-free, then the size…
Let $\mathbb{F}_q$ denote a finite field of $q$ elements. Define a set $B\subset\mathbb{F}_q^n$ to be Nikodym if for each $x\in B^{c}$, there exists a line $L$ such that $L\cap B^c=\{x\}.$ The main purpose of this note is to show that the…
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…
For any integer $d \geq 2$ and prime power $q$, we construct unexpectedly large induced matchings in the point-line incidence graph of $\mathbb{F}_{q}^{d}$ by leveraging a new connection with the Furstenberg-S\'ark\"ozy problem from…
Let F_q be a finite field with odd q elements. In this article, we prove that if E \subseteq \mathbb F_q^d, d\ge 2, and |E|\ge q, then there exists a set Y \subseteq \mathbb F_q^d with |Y|\sim q^d$ such that for all y\in Y, the number of…
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…
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…
We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…
There exists a function f: N -> N such that for every positive integer d, every quasi-finite field K and every projective hypersurface X of degree d and dimension at least f(d), the set X(K) is non-empty. This is a special case of a more…
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…
In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}|…
Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) =…
For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.
Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…
Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…
The paper deals with the solution of Shevrin ans Sapir problem. Infinite finitely presented nilsemigroup is constructed. The construction is based on aperiodic tilings, Goodman-Strauss type theorems on uniformly elliptic space. Space is…
Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
Let G be a definably compact group in an o-minimal expansion of a real closed field. We prove that if dim(G X) < dim G for some definable X subset of G then X contains a torsion point of G. Along the way we develop a general theory for…
Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…