Related papers: Random differences in Szemer\'edi's theorem and re…
We present a general technique for computing large deviations of nonlinear functions of independent Bernoulli random variables. The method is applied to compute the large deviation rate functions for subgraph counts in sparse random graphs.…
A large class of problems in sciences and engineering can be formulated as the general problem of constructing random intervals with pre-specified coverage probabilities for the mean. Wee propose a general approach for statistical inference…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
We illustrate the interplay between certain discrete and continuous problems, by presenting a method for the study of the asymptotics of a divergent sequence, through consideration of the asymptotics of its continuous analogue
We study the supremum of some random Dirichlet polynomials with independent coefficients and obtain sharp upper and lower bounds for supremum expectation thus extending the results from our previous work (see…
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on $\Z/N\Z$ introduced by Gowers in his proof of Szemer\'edi's…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
Using the density-increment strategy of Roth and Gowers, we derive Szemeredi's theorem on arithmetic progressions from the inverse conjectures GI(s) for the Gowers norms, recently established by the authors and Ziegler.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
This work is a follow-up to our previous work "A numerical approach related to defect-type theories for some weakly random problems in homogenization" (preprint available on this archive). It extends and complements, both theoretically and…
We introduce and study in detail a special class of backward continued fractions that represents a generalization of R\'enyi continued fractions. We investigate the main metrical properties of the digits occurring in these expansions and we…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
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…
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…
Inferring models, predicting the future, and estimating the entropy rate of discrete-time, discrete-event processes is well-worn ground. However, a much broader class of discrete-event processes operates in continuous-time. Here, we provide…
This is a companion note to our paper 'A relative Szemer\'edi theorem', elaborating on a concluding remark. In that paper, we showed how to prove a relative Szemer\'edi theorem for $(r+1)$-term arithmetic progressions assuming a linear…
We present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…
We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…
What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…
We apply the methods of ergodic theory to both simplify and significantly extend some classical results due to Stewart, Tijdeman, and Ruzsa. One of the notable features of our approach is the utilization of pointwise ergodic theory.