Related papers: Yet another proof of Szemeredi's theorem

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…

We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As…

We examine the limiting behavior of multiple ergodic averages associated with arithmetic progressions whose differences are elements of a fixed integer sequence. For each $\ell$, we give necessary and sufficient conditions under which…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.

We examine multidimensional polynomial progressions involving linearly independent polynomials in finite fields, proving power saving bounds for sets lacking such configurations. This jointly generalises earlier results of Peluse (for the…

The goal of this series of papers is to give a new non-commutative approach to problems about the density of reductions such as the conjecture of Joshi-Rajan, and the generalization of the conjecture of Serre. In this paper, we prove…

We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

We present a lecture note on Thouvenot's proof of the Roth-Furstenberg theorem and joining proofs of Furstenberg's theorems on multiple progression average mixing for weakly mixing transformations.

The construction introduced by Gross, Hacking and Keel allows one to construct a formal mirror family to a pair $(S,D)$ where $S$ is a smooth rational projective surface and $D$ a certain type of Weil divisor supporting an ample or…

The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it…

The Furstenberg-Zimmer structure theorem for $\mathbb{Z}^d$ actions says that every measure-preserving system can be decomposed into a tower of primitive extensions. Furstenberg and Katznelson used this analysis to prove the…

We prove a generalization of Gowers' theorem for $\mathrm{FIN}_{k}$ where, instead of the single tetris operation $T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}$, one considers all maps from $\mathrm{FIN}_{k}$ to $\mathrm{FIN}_{j}$ for…

Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…