Skip to main content

Additive problems in combinatorial number theory

Part of the Lecture Notes in Mathematics book series (LNM,volume 1383)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. W. S. Cassels, Über Basen der natürlichen Zahlenreihe, Abh. Math. Sem. Univ. Hamburg 21 (1957), 247–257.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. L. Chatrovsky, Sur les bases minimales de la suite des nombres naturels (Russian), Izv. Akad. Nauk SSSR Ser. Mat. 4 (1940), 335–340.

    MathSciNet  Google Scholar 

  3. S. L. G. Choi, P. Erdös, and M. B. Nathanson, Lagrange's theorem with N1/3 squares, Proc. of the Amer. Math. Soc. 79 (1980), 203–205.

    MATH  Google Scholar 

  4. P. Erdös, Einige Bemerkungen zur Arbeit von A. Stöhr "Gelöste und ungelöste Fragen über Basen der natürlichen Zahlenreihe," J. reine angew. Math. 197 (1957), 216–219.

    MathSciNet  Google Scholar 

  5. P. Erdös, On the multiplicative representations of integers, Israel J. Math. 2 (1964), 251–261.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. P. Erdös and R. Freud, personal communication.

    Google Scholar 

  7. P. Erdös and E. Härtter, Konstruktion von nichtperiodischen Minimalbasen mit der dichte 1/2 für die Menge der nichtnegativen ganzen Zahlen, J. reine angew. Math. 221 (1966), 44–47.

    MathSciNet  Google Scholar 

  8. P. Erdös and M. B. Nathanson, Oscillations of bases for the natural numbers, Proc. Amer. Math. Soc. 53 (1975), 253–258.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. P. Erdös and M. B. Nathanson, Systems of distinct representatives and minimal bases in additive number theory, in: M. B. Nathanson, ed., Number Theory, Carbondale 1979, Lecture Notes in Mathematics, vol. 751, Springer-Verlag, Berlin-New York, 1979, pp. 89–107.

    CrossRef  Google Scholar 

  10. P. Erdös and M. B. Nathanson, Lagrange's theorem and thin subsequences of squares, in: J. Gani and V. K. Rohatgi (eds.), Contributions to Probability, Academic Press, New York, 1981, pp. 3–9.

    CrossRef  Google Scholar 

  11. P. Erdös and M. B. Nathanson, Minimal asymptotic bases with prescribed densities, Illinois J. Math. 32 (1988), 562–574.

    MathSciNet  MATH  Google Scholar 

  12. P. Erdös and M. B. Nathanson, Asymptotic bases with many representations, Acta Arith., to appear.

    Google Scholar 

  13. P. Erdös, M. B. Nathanson, and A. Sárközy, Sumsets containing infinite arithmetic progressions, J. Number Theory 28 (1988), 159–166.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. P. Erdös and P. Turán, On a problem of Sidon in additive number theory and some related questions, J. London Math. Soc. 16 (1941), 212–215.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. M. Filaseta, Sets with elements summing to square-free numbers, C. R. Math. Rep. Acad. Sci. Canada 9 (1987), 243–246.

    MathSciNet  MATH  Google Scholar 

  16. G. Freiman, On two additive problems, to appear.

    Google Scholar 

  17. E. Härtter, Ein Beitrag zur Theorie der Minimalbasen, J. reine angew. Math. 196 (1956), 170–204.

    MathSciNet  MATH  Google Scholar 

  18. X.-D. Jia and M. B. Nathanson, A simple construction of minimal asymptotic bases, Acta Arith. 52 (1988), to appear.

    Google Scholar 

  19. M. Kneser, Abschätzungen der asymptotischen Dichte von Summenmengen, Math. Zeit. 58 (1953), 459–484.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. M. B. Nathanson, Minimal bases and maximal nonbases in additive number theory, J. Number Theory 6 (1974), 324–333.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. M. B. Nathanson, Waring's problem for sets of density zero, in: M. I. Knopp (ed.), Number Theory, Philadelphia 1980, Lecture Notes in Mathematics, Vol. 899, Springer-Verlag, Berlin-New York, 1981, pp. 301–310.

    Google Scholar 

  22. M. B. Nathanson, Waring's problem for finite intervals, Proc. Amer. Math. Soc. 96 (1986), 15–17.

    MathSciNet  MATH  Google Scholar 

  23. M. B. Nathanson, A generalization of the Goldbach-Shnirel'man theorem, Amer. Math. Monthly 94 (1987), 768–771.

    CrossRef  MathSciNet  MATH  Google Scholar 

  24. M. B. Nathanson, A short proof of Cauchy's polygonal number theorem, Proc. of the Amer. Math. Soc. 99 (1987), 22–24.

    MathSciNet  MATH  Google Scholar 

  25. M. B. Nathanson, Multiplicative representations of integers, Israel J. Math. 57 (1987), 129–136.

    CrossRef  MathSciNet  MATH  Google Scholar 

  26. M. B. Nathanson, Minimal bases and powers of 2, Acta Arith. 49 (1988), 525–532.

    MathSciNet  MATH  Google Scholar 

  27. M. B. Nathanson, Sumsets containing k-free integers, Journées Arithmétiques de Ulm, 14–18 September 1987, to appear.

    Google Scholar 

  28. M. B. Nathanson and A. Sárközy, On the maximum density of minimal asymptotic bases, Proc. Amer. Math. Soc., to appear.

    Google Scholar 

  29. M. B. Nathanson and A. Sárközy, Sumsets containing long arithmetic progressions and powers of 2, Acta Arith., to appear.

    Google Scholar 

  30. J. Nešetřil and V. Rödl, Two proofs in combinatorial number theory, Proc. Amer. Math. Soc. 93 (1985), 185–188.

    CrossRef  MathSciNet  MATH  Google Scholar 

  31. D. Raikov, Über die Basen der natürlichen Zahlenreihe, Mat. Sbor. N.S. 2 44 (1937), 595–597.

    MATH  Google Scholar 

  32. L. G. Shnirel'man, Über additive Eigenschaften von Zahlen, Math. Ann. 107 (1933), 649–690.

    CrossRef  MathSciNet  MATH  Google Scholar 

  33. A. Stöhr, Eine Basis h-ter Ordnung für die Menge aller natürlichen Zahlen, Math. Zeit. 42 (1937), 739–743.

    CrossRef  MATH  Google Scholar 

  34. A. Stöhr, Gelöste und ungelöste Fragen über Basen der natürlichen Zahlenreihe, II, J. reine angew. Math. 194 (1955), 111–140.

    MATH  Google Scholar 

  35. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199–245.

    MathSciNet  MATH  Google Scholar 

  36. E. Wirsing, Thin subbases, Analysis 6 (1986), 285–308.

    CrossRef  MathSciNet  MATH  Google Scholar 

  37. J. Zöllner, Der Vier-Quadrate-Satz und ein Problem von Erdös und Nathanson, Dissertation, Johannes Gutenberg-Universität, Mainz, 1984.

    MATH  Google Scholar 

  38. J. Zöllner, Über eine Vermutung von Choi, Erdös, und Nathanson, Acta Arith. 45 (1985), 211–213.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Nathanson, M.B. (1989). Additive problems in combinatorial number theory. In: Chudnovsky, D.V., Chudnovsky, G.V., Cohn, H., Nathanson, M.B. (eds) Number Theory. Lecture Notes in Mathematics, vol 1383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083574

Download citation

  • DOI: https://doi.org/10.1007/BFb0083574

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51549-4

  • Online ISBN: 978-3-540-46640-6

  • eBook Packages: Springer Book Archive