Dense Difference Sets and Their Combinatorial Structure

1. V. Bergelson, A density statement generalizing Schur’s Theorem, J. Comb. Theory (Series A) 43 (1986), 336–343.

   MathSciNet  Google Scholar 

2. V. Bergelson, Applications of ergodic theory to combinatorics, Dissertation (in Hebrew), Hebrew University of Jerusalem: 1984.

   Google Scholar 

3. V. Bergelson, Sets of recurrence of \({\mathbb{Z}}^{m}\) actions and properties of sets of differences in \({\mathbb{Z}}^{m}\), J. London Math. Soc. (2) 31 (1985), 295–304.

   Google Scholar 

4. V. Bergelson and N. Hindman, On IP^∗ sets and central sets, Combinatorica 14 (1994), 269–277.

   Article  MathSciNet  MATH  Google Scholar 

5. W. Deuber, N. Hindman, I. Leader, and H. Lefmann, Infinite partition regular matrices, Combinatorica, 15 (1995), 333–355.

   Article  MathSciNet  MATH  Google Scholar 

6. H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Anal. Math. 31 (1977), 204–256.

   Article  MathSciNet  MATH  Google Scholar 

7. H. Furstenberg, Recurrence in ergodic theory and combinatorial number theory, Princeton Univ. Press, Princeton, 1981.

   MATH  Google Scholar 

8. N. Hindman, On density, translates, and pairwise sums of integers, J. Comb. Theory (Series A) 33 (1982), 147–157.

   Article  MathSciNet  MATH  Google Scholar 

Download references