Related papers: Erd\H{o}s and Arithmetic Progressions
Work in progress concerning alternative formalizations of arithmetic.
The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…
This paper, written in relation to the Current Developments in Mathematics 2012 Conference, discusses the recent papers on perfectoid spaces. Apart from giving an introduction to their content, it includes some open questions, as well as…
The goal of this paper is to experiment new math concepts and theories, especially if they run counter to the classical ones. To prove that contradiction is not a catastrophe, and to learn to handle it in an (un)usual way. To transform the…
The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…
In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.
The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…
We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
We consider a finite fields version of the Erd\H{o}s-Falconer distance problem for two different sets. In a certain range for the sizes of the two sets we obtain results of the conjectured order of magnitude.
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
This is an expanded version of my talk given at the International Conference ``Algebra and Number Theory'' dedicated to the 80th anniversary of V. E. Voskresenskii, which was held at the Samara State University in May 2007. The goal is to…
We describe a list of open problems in random matrix theory and the theory of integrable systems that was presented at the conference Asymptotics in Integrable Systems, Random Matrices and Random Processes and Universality, Centre de…
We investigate the famous conjecture by Erd\H os-Simonovits and Sidorenko using information theory. Our method gives a unified treatment for all known cases of the conjecture and it implies various new results as well. Our topological type…
Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
Schauder theory is a basic tool in the study of elliptic and parabolic PDEs, asserting that solutions inherit the regularity of the coefficients. It plays a central role in establishing higher regularity for solutions to a broad class of…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
The Erd\H{o}s multiplication table problem asks what is the number of distinct integers appearing in the $N\times N$ multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the…
It is a book on geodesy and the theory of errors for the students of the cycle of geomatics, surveying and mapping. The geometric and spatial aspects of geodesy are presented in the first part of the book. The second part is about the…