Mathematics – Combinatorics
Scientific paper
2003-10-30
Mathematics
Combinatorics
31 pages. New version has an extra section and some remarks reflecting recent developments
Scientific paper
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some results in additive number theory. One is a structure theorm for sets which are almost sum-free. If A is a subset of [N] which contains just o(N^2) triples (x,y,z) such that x + y = z then A may be written as the union of B and C, where B is sum-free and |C| = o(N). Another answers a question of Bergelson, Host and Kra. If alpha, epsilon > 0, if N > N_0(alpha,epsilon) and if A is a subset of {1,...,N} of size alpha N, then there is some non-zero d such that A contains at least (alpha^3 - epsilon)N three-term arithmetic progressions with common difference d.
No associations
LandOfFree
A Szemeredi-type regularity lemma in abelian groups, with applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Szemeredi-type regularity lemma in abelian groups, with applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Szemeredi-type regularity lemma in abelian groups, with applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-250901