相关论文: A Szemeredi-type regularity lemma in abelian group…

It is well known that the classical diagram lemmas of homological algebra for abelian groups can be generalized to non-abelian group-like structures, such as groups, rings, algebras, loops, etc. In this paper we establish such a…

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…

We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…

Szemer\'edi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R\"odl proved an analogue of Szemer\'edi's regularity lemma…

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemer\'edi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between…

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…

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

We extend Szemeredi's Regularity Lemma (SRL) to abstract measure spaces. Our main aim is to find general conditions under which the original proof of Szemeredi still works. To illustrate that our approach has some merit, we outline several…

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

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…

We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

We give a proof of Szemeredi's regularity lemma in the special case of a graph with bounded VC dimension and show that it is possible to obtain "merely" doubly exponential bounds on the size of the partition in this case.

Suppose that G is an abelian group and A is a finite subset of G containing no three-term arithmetic progressions. We show that |A+A| >> |A|(log |A|)^{1/3-\epsilon} for all \epsilon>0.