Let $r_5(N)$ be the largest cardinality of a set in $\{1,\ldots,N\}$ which does not contain 5 elements in arithmetic progression. Then there exists a constant $c\in (0,1)$ such that

\[r_5(N)\ll \frac{N}{\exp\!((\!\log\log N)^{c})}.\]

$U^4$

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the ai and b are fixed coefficients and h is an arbitrary integer polynomial of degree d. We establish that the natural necessary conditions for this equation to have a monochromatic non-constant solution with respect to any finite colouring of the prime numbers are also sufficient when the equation has at least $(1+o(1))d^2$ variables. We similarly characterize when such equations admit solutions over any set of primes with positive relative upper density. In both cases, we obtain lower bounds for the number of monochromatic or dense solutions in primes that are of the correct order of magnitude. Our main new ingredient is a uniform lower bound on the cardinality of a prime polynomial Bohr set.

Inspired by Adler’s idea on VC minimal theories [1], we introduce VC-minimal complexity. We show that for any $N\in \mathbb {N}^{>0}$, there is $k_N>0$ such that for any finite bipartite graph $(X,Y;E)$ with VC-minimal complexity $< N$, there exist $X'\subseteq X$, $Y'\subseteq Y$ with $|X'|\geq k_N |X|$, $|Y'|\geq k_N |Y|$ such that $X'\times Y' \subseteq E$ or $X'\times Y'\cap E=\emptyset $.

We extend the Kechris–Pestov–Todorčević correspondence to weak Fraïssé categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property. We demonstrate the theory on several examples including monoid categories, the category of almost linear orders and categories of strong embeddings of trees.

We show that every finite coloring of the rationals contains monochromatic sets of the form $\{x,y,xy,x+y\}$.

Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey property, where $\mathcal{F}$ consists of one graph, in the binomial random graph was located in the celebrated work of Rödl and Ruciński.

In this paper, we offer a twofold generalisation to the Rödl–Ruciński theorem. First, we show that the list-colouring version of the property has the same threshold. Second, we extend this result to finite families $\mathcal{F}$, where the threshold statements might also diverge. This also confirms further special cases of the Kohayakawa–Kreuter conjecture. Along the way, we supply a short(-ish), self-contained proof of the $0$-statement of the Rödl–Ruciński theorem.

Daisies are a special type of hypergraph introduced by Bollobás, Leader and Malvenuto. An $r$-daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r+|K|)$-uniform hypergraph $\{K\cup P\,{:}\, P\in M^{(r)}\}$. Bollobás, Leader and Malvenuto initiated the study of Turán type density problems for daisies. This paper deals with Ramsey numbers of daisies, which are natural generalisations of classical Ramsey numbers. We discuss upper and lower bounds for the Ramsey number of $r$-daisies and also for special cases where the size of the kernel is bounded.

A $(k+r)$-uniform hypergraph $H$ on $(k+m)$ vertices is an $(r,m,k)$-daisy if there exists a partition of the vertices $V(H)=K\cup M$ with $|K|=k$, $|M|=m$ such that the set of edges of $H$ is all the $(k+r)$-tuples $K\cup P$, where $P$ is an $r$-tuple of $M$. We obtain an $(r-2)$-iterated exponential lower bound to the Ramsey number of an $(r,m,k)$-daisy for $2$-colours. This matches the order of magnitude of the best lower bounds for the Ramsey number of a complete $r$-graph.

We prove a Khintchine-type recurrence theorem for pairs of endomorphisms of a countable discrete abelian group. As a special case of the main result, if $\Gamma $ is a countable discrete abelian group, $\varphi , \psi \in \mathrm {End}(\Gamma )$, and $\psi - \varphi $ is an injective endomorphism with finite index image, then for any ergodic measure-preserving $\Gamma $-system $( X, {\mathcal {X}}, \mu , (T_g)_{g \in \Gamma } )$, any measurable set $A \in {\mathcal {X}}$, and any ${\varepsilon }> 0$, there is a syndetic set of $g \in \Gamma$ such that $\mu ( A \cap T_{\varphi(g)}^{-1} A \cap T_{\psi(g)}^{-1} A ) > \mu(A)^3 - \varepsilon$. This generalizes the main results of Ackelsberg et al [Khintchine-type recurrence for 3-point configurations. Forum Math. Sigma 10 (2022), Paper no. e107] and essentially answers a question left open in that paper [Question 1.12; Khintchine-type recurrence for 3-point configurations. Forum Math. Sigma 10 (2022), Paper no. e107]. For the group $\Gamma = {\mathbb {Z}}^d$, the result applies to pairs of endomorphisms given by matrices whose difference is non-singular. The key ingredients in the proof are: (1) a recent result obtained jointly with Bergelson and Shalom [Khintchine-type recurrence for 3-point configurations. Forum Math. Sigma 10 (2022), Paper no. e107] that says that the relevant ergodic averages are controlled by a characteristic factor closely related to the quasi-affine (or Conze–Lesigne) factor; (2) an extension trick to reduce to systems with well-behaved (with respect to $\varphi $ and $\psi $) discrete spectrum; and (3) a description of Mackey groups associated to quasi-affine cocycles over rotational systems with well-behaved discrete spectrum.

We investigate the notion of a semi-retraction between two first-order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We look at semi-retractions through a new lens establishing transfers of the Ramsey property and finite Ramsey degrees under quite general conditions that are optimal as demonstrated by counterexamples. Finally, we compare semi-retractions to the category theoretic notion of a pre-adjunction.

For graphs $G$ and $H$, the Ramsey number $r(G,H)$ is the smallest positive integer $N$ such that any red/blue edge colouring of the complete graph $K_N$ contains either a red $G$ or a blue $H$. A book $B_n$ is a graph consisting of $n$ triangles all sharing a common edge.

Recently, Conlon, Fox, and Wigderson conjectured that for any $0\lt \alpha \lt 1$, the random lower bound $r(B_{\lceil \alpha n\rceil },B_n)\ge (\sqrt{\alpha }+1)^2n+o(n)$ is not tight. In other words, there exists some constant $\beta \gt (\sqrt{\alpha }+1)^2$ such that $r(B_{\lceil \alpha n\rceil },B_n)\ge \beta n$ for all sufficiently large $n$. This conjecture holds for every $\alpha \lt 1/6$ by a result of Nikiforov and Rousseau from 2005, which says that in this range $r(B_{\lceil \alpha n\rceil },B_n)=2n+3$ for all sufficiently large $n$.

We disprove the conjecture of Conlon, Fox, and Wigderson. Indeed, we show that the random lower bound is asymptotically tight for every $1/4\leq \alpha \leq 1$. Moreover, we show that for any $1/6\leq \alpha \le 1/4$ and large $n$, $r(B_{\lceil \alpha n\rceil }, B_n)\le \left (\frac 32+3\alpha \right ) n+o(n)$, where the inequality is asymptotically tight when $\alpha =1/6$ or $1/4$. We also give a lower bound of $r(B_{\lceil \alpha n\rceil }, B_n)$ for $1/6\le \alpha \lt \frac{52-16\sqrt{3}}{121}\approx 0.2007$, showing that the random lower bound is not tight, i.e., the conjecture of Conlon, Fox, and Wigderson holds in this interval.

For many years, there have been conducting research (e.g., by Bergelson, Furstenberg, Kojman, Kubiś, Shelah, Szeptycki, Weiss) into sequentially compact spaces that are, in a sense, topological counterparts of some combinatorial theorems, for instance, Ramsey’s theorem for coloring graphs, Hindman’s finite sums theorem, and van der Waerden’s arithmetical progressions theorem. These spaces are defined with the aid of different kinds of convergences: IP-convergence, R-convergence, and ordinary convergence.

The first aim of this paper is to present a unified approach to these various types of convergences and spaces. Then, using this unified approach, we prove some general theorems about existence of the considered spaces and show that all results obtained so far in this subject can be derived from our theorems.

The second aim of this paper is to obtain new results about the specific types of these spaces. For instance, we construct a Hausdorff Hindman space that is not an $\mathcal {I}_{1/n}$-space and a Hausdorff differentially compact space that is not Hindman. Moreover, we compare Ramsey spaces with other types of spaces. For instance, we construct a Ramsey space that is not Hindman and a Hindman space that is not Ramsey.

The last aim of this paper is to provide a characterization that shows when there exists a space of one considered type that is not of the other kind. This characterization is expressed in purely combinatorial manner with the aid of the so-called Katětov order that has been extensively examined for many years so far.

This paper may interest the general audience of mathematicians as the results we obtain are on the intersection of topology, combinatorics, set theory, and number theory.

The Halpern–Läuchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles about products of perfect Polish spaces. These principles yield straightforward proofs of the Halpern–Läuchli theorem, and the same forcing from Harrington’s proof can force their consistency. We also show that these principles are not ZFC theorems by showing that they put lower bounds on the size of the continuum.

It is known that in an infinite very weakly cancellative semigroup with size $\kappa $, any central set can be partitioned into $\kappa $ central sets. Furthermore, if $\kappa $ contains $\lambda $ almost disjoint sets, then any central set contains $\lambda $ almost disjoint central sets. Similar results hold for thick sets, very thick sets and piecewise syndetic sets. In this article, we investigate three other notions of largeness: quasi-central sets, C-sets, and J-sets. We obtain that the statement applies for quasi-central sets. If the semigroup is commutative, then the statement holds for C-sets. Moreover, if $\kappa ^\omega = \kappa $, then the statement holds for J-sets.

We demonstrate that the phenomenon of popular differences (aka the phenomenon of large intersections) holds for natural families of polynomial patterns in rings of integers of number fields. If K is a number field with ring of integers $\mathcal{O}_K$ and $E \subseteq \mathcal{O}_K$ has positive upper Banach density $d^*(E) = \delta > 0$, we show, inter alia:

1. (1) if $p(x) \in K[x]$ is an intersective polynomial (i.e., p has a root modulo m for every $m \in \mathcal{O}_K$) with $p(\mathcal{O}_K) \subseteq \mathcal{O}_K$ and $r, s \in \mathcal{O}_K$ are distinct and nonzero, then for any $\varepsilon > 0$, there is a syndetic set $S \subseteq \mathcal{O}_K$ such that for any $n \in S$,

   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + rp(n), x + sp(n)\} \subseteq E \right\} \right) > \delta^3 - \varepsilon. \end{align*}
   Moreover, if ${s}/{r} \in \mathbb{Q}$, then there are syndetically many $n \in \mathcal{O}_K$ such that
   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + rp(n), x + sp(n), x + (r+s)p(n)\} \subseteq E \right\} \right)> \delta^4 - \varepsilon; \end{align*}

2. (2) if $\{p_1, \dots, p_k\} \subseteq K[x]$ is a jointly intersective family (i.e., $p_1, \dots, p_k$ have a common root modulo m for every $m \in \mathcal{O}_K$) of linearly independent polynomials with $p_i(\mathcal{O}_K) \subseteq \mathcal{O}_K$, then there are syndetically many $n \in \mathcal{O}_K$ such that

   \begin{align*}d^* \left( \left\{ x \in \mathcal{O}_K \;:\; \{x, x + p_1(n), \dots, x + p_k(n)\} \subseteq E \right\} \right)> \delta^{k+1} - \varepsilon. \end{align*}

These two results generalise and extend previous work of Frantzikinakis and Kra [21] and Franztikinakis [19] on polynomial configurations in $\mathbb{Z}$ and build upon recent work of the authors and Best [2] on linear patterns in general abelian groups. The above combinatorial results follow from multiple recurrence results in ergodic theory via a version of Furstenberg’s correspondence principle. The ergodic-theoretic recurrence theorems require a sharpening of existing tools for handling polynomial multiple ergodic averages. A key advancement made in this paper is a new result on the equidistribution of polynomial orbits in nilmanifolds, which can be seen as a far-reaching generalisation of Weyl’s equidistribution theorem for polynomials of several variables:

1. (3) let $d, k, l \in \mathbb{N}$. Let $(X, \mathcal{B}, \mu, T_1, \dots, T_l)$ be an ergodic, connected $\mathbb{Z}^l$-nilsystem. Let $\{p_{i,j} \;:\; 1 \le i \le k, 1 \le j \le l\} \subseteq \mathbb{Q}[x_1, \dots, x_d]$ be a family of polynomials such that $p_{i,j}\left( \mathbb{Z}^d \right) \subseteq \mathbb{Z}$ and $\{1\} \cup \{p_{i,j}\}$ is linearly independent over $\mathbb{Q}$. Then the $\mathbb{Z}^d$-sequence $\left( \prod_{j=1}^l{T_j^{p_{1,j}(n)}}x, \dots, \prod_{j=1}^l{T_j^{p_{k,j}(n)}}x \right)_{n \in \mathbb{Z}^d}$ is well-distributed in $X^k$ for every x in a co-meager set of full measure.

Resolving a problem of Conlon, Fox and Rödl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and q-colour Ramsey numbers. The main lemma underlying this construction is a new variant of the Erdős–Hajnal stepping-up lemma for a generalized Ramsey number $r_k(t;q,p)$, which we define as the smallest integer n such that every q-colouring of the k-sets on n vertices contains a set of t vertices spanning fewer than p colours. Our results provide the first tower-type lower bounds on these numbers.

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 the utilization of $\mathcal R$-limits, a notion of convergence which is based on the classical Ramsey theorem. $\mathcal R$-limits are intrinsically connected with a new combinatorial notion of largeness which is similar to but has stronger properties than the classical notions of uniform density one and IP$^*$. While the main goal of this paper is to establish a universal property of strongly mixing actions of countable abelian groups, our results, when applied to ${\mathbb {Z}}$-actions, offer a new way of dealing with strongly mixing transformations. In particular, we obtain several new characterizations of strong mixing for ${\mathbb {Z}}$-actions, including a result which can be viewed as the analogue of the weak mixing of all orders property established by Furstenberg in the course of his proof of Szemerédi’s theorem. We also demonstrate the versatility of $\mathcal R$-limits by obtaining new characterizations of higher-order weak and mild mixing for actions of countable abelian groups.

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size $C\log _2 n$ (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.

The proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.

We show that the size-Ramsey number of the $\sqrt{n} \times \sqrt{n}$ grid graph is $O(n^{5/4})$, improving a previous bound of $n^{3/2 + o(1)}$ by Clemens, Miralaei, Reding, Schacht, and Taraz.