相关论文: The dichotomy between structure and randomness, ar…

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

The well--known Freiman--Ruzsa Theorem provides a structural description of a set $A$ of integers with $|2A|\le c|A|$ as a subset of a $d$--dimensional arithmetic progression $P$ with $|P|\le c'|A|$, where $d$ and $c'$ depend only on $c$.…

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

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…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

In this paper, we prove several results on the structure of maximal sets $S \subseteq [N]$ such that $S$ mod $p$ is contained in a short arithmetic progression, or the union of short progressions, where $p$ ranges over a subset of primes in…

Very recently, Green and Sawhney obtained a quasipolynomial bound in the Furstenberg--S\'ark\"ozy theorem for square differences by proving an ''arithmetic level-$d$'' inequality, thereby yielding a greatly improved density increment…

We prove that any strongly mixing action of a countable abelian group on a probability space has higher order mixing properties. This is achieved via introducing and utilizing $\mathcal R$-limits, a notion of convergence which is based on…

Diversity is a fundamental feature of ecosystems, even when the concept of ecosystem is extended to sociology or economics. Diversity can be intended as the count of different items, animals, or, more generally, interactions. There are two…

For any fixed $d\geq1$ and subset $X$ of $\mathbb{N}^d$, let $r_X(n)$ be the maximum cardinality of a subset $A$ of $\{1,\dots,n\}^d$ which does not contain a subset of the form $\vec{b} + rX$ for $r>0$ and $\vec{b} \in \mathbb{R}^d$. Such…

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

Given a subset of the integers of zero density, we define the weaker notion of fractional density of such a set. It is shown how this notion corresponds to that of the Hausdorff dimension of a compact subset of the reals. We then show that…

Structured deformations provide a multiscale geometry that captures the contributions at the macrolevel of both smooth geometrical changes and non-smooth geometrical changes (disarrangements) at submacroscopic levels. For each (first-order)…

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

The characteristic sequence of hypergraphs $<P_n : n<\omega>$ associated to a formula $\phi(x;y)$, introduced in [arXiv:0908.4111], is defined by $P_n(y_1,... y_n) = (\exists x) \bigwedge_{i\leq n} \phi(x;y_i)$. This paper continues the…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…