Related papers: A note on lower bounds for arithmetic regularity p…
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…
We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck^2/\log^* k pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute…
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemer{\'e}di regularity lemma in graph theory. It shows that for any abelian group $G$ and any bounded function $f:G \to [0,1]$, there exists a subgroup…
We consider here the strong regularity for $3$-uniform hypergraphs developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. This type of regular decomposition comes with two components, a partition of the vertices, and…
This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…
The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…
This is Part 1 in a series of papers about sizes of regular partitions of $3$-uniform hypergraphs. Previous work of the author and Wolf, and independently Chernikov and Towsner, showed that $3$-uniform hypergraphs of small slicewise…
Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…
This is Part 2 in a series of papers about the growth of regular partitions in hereditary properties $3$-uniform hypergraphs. The focus of this paper is the notion of weak hypergraph regularity, first developed by Chung, Chung-Graham, and…
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…
A regular partition $\mathcal{P}$ for a $3$-uniform hypergraph $H=(V,E)$ consists of a partition $V=V_1\cup \ldots \cup V_t$ and for each $ij\in {[t]\choose 2}$, a partition $K_2[V_i,V_j]=P_{ij}^1\cup \ldots \cup P_{ij}^{\ell}$, such that…
Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…
Addressing a question of Gowers, we determine the order of the tower height for the partition size in a version of Szemer\'edi's regularity lemma.
While Szemer\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus…
Kolla and Tulsiani [KT07,Kolla11} and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time…
We introduce a new variant of Szemer\'edi's regularity lemma which we call the "sparse regular approximation lemma" (SRAL). The input to this lemma is a graph $G$ of edge density $p$ and parameters $\epsilon, \delta$, where we think of…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
Green developed an arithmetic regularity lemma to prove a strengthening of Roth's theorem on arithmetic progressions in dense sets. It states that for every $\epsilon > 0$ there is some $N_0(\epsilon)$ such that for every $N \ge…
The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…
A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…