arXiv subjects
Publications and source records attributed to Misha Rudnev.
We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.
This note improves the best known exponent 1/12 in the prime field sum-product inequality (for small sets) to 1/11, modulo a logarithmic factor.
Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine $\geq c n^{1 + {1/267}}$ lines, where $c$ is an absolute constant. We derive from this an incidence theorem: the number of incidences between a set of $n$ points and a set of $n$ lines in the projective plane over $\F_p$ ($n<\sqrt{p}$) is bounded by $C n^{{3/2}-{1/10678}}$, where $C$ is an absolute constant.
In a recent paper \cite{Gl} A. Glibichuk proved that if $A,B$ are subsets of an arbitrary finite filed $\F_q$, such that $|A||B|>q$, then $16AB = \F_q$. We improve this to $10AB = \F_q.$
In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and volumes have also received much attention. In this paper we prove a relatively straightforward function version of an incidence results for points and planes previously established in \cite{HI07} and \cite{HIKR07}. As a consequence of our methods, we obtain sharp or near sharp results on the distribution of volumes determined by subsets of vector spaces over finite fields and the associated arithmetic expressions. In particular, our machinery enables us to prove that if $E \subset {\Bbb F}_q^d$, $d \ge 4$, the $d$-dimensional vector space over a finite field ${\Bbb F}_q$, of size much greater than $q^{\frac{d}{2}}$, and if $E$ is a product set, then the set of volumes of $d$-dimensional parallelepipeds determined by $E$ covers ${\Bbb F}_q$. This result is sharp as can be seen by taking $E$ to equal to $A \times A \times ... \times A$, where $A$ is a sub-field of ${\Bbb F}_q$ of size $\sqrt{q}$. In three dimensions we establish the same result if $|E| \gtrsim q^{15/8}$. We prove in three dimensions that the set of volumes covers a positive proportion of ${\Bbb F}_q$ if $|E| \ge Cq^{3/2}$. Finally we show that in three dimensions the set of volumes covers a positive proportion of ${\Bbb F}_q$ if $|E| \ge Cq^2$, without any further assumptions on $E$, which is again sharp as taking $E$ to be a 2-plane through the origin shows.
We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets contained in a sphere. We use these incidence bounds to obtain significant improvements on the arithmetic problem of covering ${\mathbb F}_q$, the finite field with q elements, by $A \cdot A+... +A \cdot A$, where A is a subset ${\mathbb F}_q$ of sufficiently large size. We also use the incidence machinery we develope and arithmetic constructions to study the Erdos-Falconer distance conjecture in vector spaces over finite fields. We prove that the natural analog of the Euclidean Erdos-Falconer distance conjecture does not hold in this setting due to the influence of the arithmetic. On the positive side, we obtain good exponents for the Erdos -Falconer distance problem for subsets of the unit sphere in $\mathbb F_q^d$ and discuss their sharpness. This results in a reasonably complete description of the Erdos-Falconer distance problem in higher dimensional vector spaces over general finite fields.
We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections between the Erdos and Falconer distance problems in geometric combinatorics and geometric measure theory, respectively.
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been classically used to study this problem. We conjecture that a majorant for the spherical means suffices to prove the distance conjecture(s) in this setting. For a class of non-Euclidean distances, we show that this generally cannot be achieved, at least in dimension two, by considering integer point distributions on convex curves and surfaces. In higher dimensions, we link this problem to the question about the existence of smooth well-curved hypersurfaces that support many integer points.
We study the Erdös/Falconer distance problem in vector spaces over finite fields. Let ${\Bbb F}_q$ be a finite field with $q$ elements and take $E \subset {\Bbb F}^d_q$, $d \ge 2$. We develop a Fourier analytic machinery, analogous to that developed by Mattila in the continuous case, for the study of distance sets in ${\Bbb F}^d_q$ to provide estimates for minimum cardinality of the distance set $Δ(E)$ in terms of the cardinality of $E$. Kloosterman sums play an important role in the proof.