Related papers: Exploration on Incidence Geometry and Sum-Product …
The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…
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…
The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…
This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…
The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…
We study random exponential sums of the form $\sum_{k=1}^nX_k\times\ex p\{i(\lambda_k^{(1)}t_1+...+\lambda_k^{(s)}t_s)\}$, where $\{X_n\}$ is a sequence of random variables and $\{\lambda_n^{(i)}:1\leq i\leq s\}$ are sequences of real…
The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…
We investigate the interplay between the discrete restriction phenomenon and incidence theory. Two angles are explored. One is a refinement of the machinery developed by Thomas Wolff, which when combined with a recent subcritical estimate…
A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…
This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
Incidence theorems concern configurations of points, lines, and, more generally, higher-dimensional subspaces in projective space. Broadly speaking, such theorems fall into two classes: those that hold over an arbitrary division ring, such…
Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…
We develop the methods used by Rudnev and Wheeler to prove an incidence theorem between arbitrary sets of M\"{o}bius transformations and point sets in $\mathbb F_p^2$. We also note some asymmetric incidence results, and give applications of…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…
Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…
Furstenberg-Weiss have extended Szemer\'edi's theorem on arithmetic progressions to trees by showing that a large subset of the tree contains arbitrarily long arithmetic subtrees. We study higher dimensional versions that analogously extend…