Related papers: Bounds on point configurations determined by dista…
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) =…
In this paper we consider the overdetermined boundary problem for a general second order semilinear elliptic equation on bounded domains of $\mathbf{R}^n$, where one prescribes both the Dirichlet and Neumann data of the solution. We are…
We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?
We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…
The hierarchy poset and branch point poset for a data set both admit a calculus of least upper bounds. A method involving upper bounds is used to show that the map of branch points associated to the inclusion of data sets is a controlled…
This note is a continuation of an earlier paper by the authors. We describe improved constructions addressing a question of Erd\H{o}s and Szemer\'edi on sums and products of real numbers along the edges of a graph. We also add a few…
We provide bounds on the sizes of the gaps -- defined broadly -- in the set $\{k_1\beta_1 + \ldots + k_n\beta_n \mbox{ (mod 1)} : k_i \in \mathbb Z \cap (0,Q^\frac{1}{n}]\}$ for generic $\beta_1, \ldots, \beta_n \in \mathbb R^m$ and all…
In this paper we introduce a unified approach to deal with incidence problems between points and varieties over finite fields. More precisely, we prove that the number of incidences $I(\mathcal{P}, \mathcal{V})$ between a set $\mathcal{P}$…
We show that the number of unit distances determined by n points in R^3 is O(n^{3/2}), slightly improving the bound of Clarkson et al. established in 1990. The new proof uses the recently introduced polynomial partitioning technique of Guth…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
The matching number of a family of subsets of an $n$-element set is the maximum number of pairwise disjoint sets. The families with matching number $1$ are called intersecting. The famous Erd\H os-Ko-Rado theorem determines the size of the…
We say that a set of points $S\subset \mathbb{R}^d$ is an $\varepsilon$-nearly $k$-distance set if there exist $1\le t_1\le \ldots\le t_k,$ such that the distance between any two distinct points in $S$ falls into…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
An old problem in discrete geometry, originating with Kupitz, asks whether there is a fixed natural number $k$ such that every finite set of points in the plane has a line through at least two of its points where the number of points on…
We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…
In their seminal paper Erd\H{o}s and Szemer\'edi formulated conjectures on the size of sumset and product set of integers. The strongest form of their conjecture is about sums and products along the edges of a graph. In this paper we show…
Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…