Related papers: Sieving and the Erd{\H o}s-Kac theorem

We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.

We prove the existence of a successful coupling for $n$ particles in the symmetric inclusion process. As a consequence we characterize the ergodic measures with finite moments, and obtain sufficient conditions for a measure to converge in…

We give a short proof of a strengthening of the Maximal Ergodic Theorem which also immediately yields the Pointwise Ergodic Theorem.

We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.

We give an historical account, including recent progress, on some problems of Erd\H os in number theory.

The classical theorem of Erd\H os \& Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under…

We investigate the number of prime factors of individual entries for matrices in the special linear group over the integers. We show that, when properly normalised, it satisfies a central limit theorem of Erd\H{o}s-Kac-type. To do so, we…

We extend the famous Erd\H{o}s-Szekeres theorem to $k$-flats in ${\mathbb{R}^d}$

We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.

We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.

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 use the theory of unipotent flows to prove, in a general setting, the equidistribution of Hecke points. We follow the approach of Burger-Sarnak, and use a theorem of Mozes-Shah.

In this paper we prove the Bohr Theorem for slice regular functions. Following the historical path that led to the proof of the classical Bohr Theorem, we also extend the Borel-Carath\'eodory Theorem to the new setting.

We give a new proof of the Kat\v{e}tov-Tong theorem. Our strategy is to first prove the theorem for compact Hausdorff spaces, and then extend it to all normal spaces. The key ingredient is how the ring of bounded continuous real-valued…

Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.

We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…

This paper is an extension program of the notion of circle of partition developed in our first paper \cite{CoP}. As an application we prove the Erd\H{o}s-Tur\'{a}n additive base conjecture.

This paper provides a new simple proof of Hesse's theorem in projective geometry for any dimension.

Arguably the simplest variation of this style of proof as we avoid reducing to the cubic case entirely.

We prove an analytic KAM-Theorem, which is used in [1], where the differential part of KAM-theory is discussed. Related theorems on analytic KAM-theory exist in the literature (e. g., among many others, [7], [8], [13]). The aim of the…