Related papers: Erd\H{o}s and Arithmetic Progressions
According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…
This survey article on Hilbert's first and second problems is adapted from a one-hour colloquium lecture given at the University of Auckland in May, 2000, just three months before the 100th anniversary of Hilbert's lecture. It includes an…
The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations…
This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…
H\"{o}lder's inequality, since its appearance in 1888, has played a fundamental role in Mathematical Analysis and it is, without any doubt, one of the milestones in Mathematics. It may seem strange that, nowadays, it keeps resurfacing and…
This is a survey article, to appear in the Proceedings of the 2018 International Congress of Mathematicians. (Revised, with added and updated references.)
In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…
In this expository note we present simple proofs of the lower bound of Ramsey numbers (Erd\"os theorem), and of the estimation of discrepancy. Neither statements nor proofs require any knowledge beyond high-school curriculum (except a minor…
This survey presents an overview of the advances around Tverberg's theorem, focusing on the last two decades. We discuss the topological, linear-algebraic, and combinatorial aspects of Tverberg's theorem and its applications. The survey…
These lecture notes are based on a set of six lectures that I gave in Edinburgh in 2008/2009 and they cover some topics in the interface between Geometry and Physics. They involve some unsolved problems and conjectures and I hope they may…
In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…
We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemer\'edi's theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we…
We improve the current bounds for an inequality of Erd\H{o}s and Tur\'an from 1950 related to the discrepancy of angular equidistribution of the zeros of a given polynomial. Building upon a recent work of Soundararajan, we establish a novel…
The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…
Erd\H{o}s-Stone Theorem is a well-known result in extremal graph theory which determines the asymptotic behaviour of maximum number of edges in an $n$-vertex $H$-free graph. In 2009, Nikiforov gave a spectral version of Erd\H{o}s-Stone…
This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…
Inspired by the Erd\H{o}s' problem in Ramsey theory, we propose a dynamical version of the problem and answer it positively for circle maps.
The ideas here are a continuation of a previous article. Some of the applications of the main ideas in the previous article are explained, along with some limitations of the general ideas. There are situations where additional hypotheses…
There is a mathematical error in the first version of this paper. A new corrected version will be posted when the error is fixed, possibly with a modified title.
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…