The polynomial method and restricted sums of congruence classes

Journal of Number Theory

Volumn 56, Issue 2, 1996, Pages 404-417

  Alon, Noga ^a   Nathanson, Melvyn B ^b   Ruzsa, Imre ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030079231     PISSN: 0022314X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jnth.1996.0029     Document Type: Article

References (19)

1. 1. N. ALON, M. B. NATHANSON, AND I. Z. RUZSA, Adding distinct congruence classes modulo a prime, American Math. Monthly 102 (1995), 250-255.
2. 2. N. ALON AND M. TARSI, Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134.
3. 3. H. DAVENPORT, On the addition of residue classes, J. London Math. Soc. 10 (1935), 30-32.
4. 4. J. A. DIAS DA SILVA AND Y. O. HAMIDOUNE, Cyclic spaces for Grassmann derivatives and additive theory, Bull. London Math. Soc. 26 (1994), 140-146.
5. 5. P. ERDOS AND R. L. GRAHAM, "Old and New Problems and Results in Combinatorial Number Theory," L'Enseignement Mathématique, Geneva, 1980.
6. 6. G. A. FREIMAN, L. LOW, AND J. PITMAN, The proof of Paul Erdos conjecture of the addition of different residue classes modulo a prime number, preprint, 1992.
7. 7. J. GUNSON, Proof of a conjecture of Dyson in the statistical theory of energy levels, J. Math. Phys. 3 (1962), 752-753.
8. 8. M. P. A. MACMAHON, "Combinatory Analysis," Chap. V, Chelsea, New York, 1915.
9. 9. R. MANSFIELD, How many slopes in a polygon? Israel J. Math. 39 (1981), 265-272.
10. 10. M. B. NATHANSON. "Additive Number Theory. 1. Inverse Theorems and the Geometry of Sumsets," Springer-Verlag, New York, 1994.
11. 11. L. PYBER, On the Erdos-Heilbronn conjecture, personal communication.
12. 12. U.-W. RICKERT, "Über eine Vermutung in der Additiven Zahlentheorie," Ph.D. thesis, Tech. Univ. Braunschweig, 1976.
13. 13. Ö. J. RÖDSETH, Sums of distinct residues mod p, Acta Arith. 65 (1994), 181-184.
14. 14. R. L. RIVEST AND A. SHAMIR. How to reuse a "write once" memory, Inform. Comput. 55 (1982), 1-19.
15. 15. J. R. STEMBRIDGE, A short proof of Macdonald's Conjecture for the root systems of type A, Proc. AMS 102 (1988), 777-786.
16. 16. A. G. VOSPER, The critical pairs of subsets of a group of prime order, J. London Math. Soc. 31 (1956), 200-205.
17. 17. A. G. VOSPER, Addendum to "The critical pairs of subsets of a group of prime order," J. London Math. Soc. 31 (1956), 280-282.
18. 18. K. WILSON, Proof of a conjecture of Dyson, J. Math. Phys. 3 (1962), 1040-1043.
19. 19. D. ZEILBERGER, A combinatorial proof of Dyson's conjecture, Discrete Math. 41 (1982), 317-321.