Advertisement

Inverse Problems for Representation Functions in Additive Number Theory

  • Melvyn B. NathansonEmail author
Chapter
Part of the Developments in Mathematics book series (DEVM, volume 17)

For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product, if X is nonabelian) of h not necessarily distinct elements of X. The direct problem for representation functions in additive number theory begins with a subset A of X and seeks to understand its representation functions. The inverse problem for representation functions starts with a function f:Xrightarrow \N_0 ∪ ∞ and asks whether there is a set A whose representation function is f, and, if the answer is yes, to classify all such sets. This paper is a survey of recent progress on the inverse representation problem.

Additive bases sumsets representation functions additive inverse problems asymptotic density ErdŐ s–Turán conjecture Sidon sets Bh[g] sequences. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Y.-G. Chen, A problem on unique representation bases, European J. Combin. 28 (2007), no. 1, 33–35.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    J. Cilleruelo and M. B. Nathanson, Dense sets of integers with prescribed representation functions, preprint, 2007.Google Scholar
  3. 3.
    J. Cilleruelo, Perfect difference sets constructed from Sidon sets, Combinatorica (to appear).Google Scholar
  4. 4.
    G. A. Dirac, Note on a problem in additive number theory, J. London Math. Soc. 26 (1951), 312–313.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    P. Erdős and P. Turán, On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc. 16 (1941), 212–215.CrossRefMathSciNetGoogle Scholar
  6. 6.
    P. Erdős, On the multiplicative representation of integers, Israel J. Math. 2 (1964), 251–261.CrossRefMathSciNetGoogle Scholar
  7. 7.
    J. A. Ewell, On the determination of sets by sets of sums of fixed order, Canad. J. Math. 20 (1968), 596–611.MathSciNetGoogle Scholar
  8. 8.
    B. Gordon, A. S. Fraenkel, and E. G. Straus, On the determination of sets by the sets of sums of a certain order, Pacific J. Math. 12 (1962), 187–196.zbMATHMathSciNetGoogle Scholar
  9. 9.
    J. Lee, Infinitely often dense bases with a prescribed representation function, arXiv preprint, 2007.Google Scholar
  10. 10.
    J. C. M. Nash and M. B. Nathanson, Cofinite subsets of asymptotic bases for the positive integers, J. Number Theory 20 (1985), no. 3, 363–372.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    M. B. Nathanson, Representation functions of sequences in additive number theory, Proc. Amer. Math. Soc. 72 (1978), no. 1, 16–20.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    M. B. Nathanson, Multiplicative representations of integers, Israel J. Math. 57 (1987), no. 2, 129–136.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    M. B. Nathanson, Additive number theory: The classical bases, Graduate Texts in Mathematics, vol. 164, Springer-Verlag, New York, 1996.Google Scholar
  14. 14.
    M. B. Nathanson, Unique representation bases for the integers, Acta Arith. 108 (2003), no. 1, 1–8.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    M. B. Nathanson, The inverse problem for representation functions of additive bases, Number theory (New York, 2003), Springer, New York, 2004, pp. 253–262.Google Scholar
  16. 16.
    M. B. Nathanson, Representation functions of additive bases for abelian semigroups, Int. J. Math. Math. Sci. (2004), no. 29-32, 1589–1597.CrossRefMathSciNetGoogle Scholar
  17. 17.
    M. B. Nathanson, Every function is the representation function of an additive basis for the integers, Port. Math. (N.S.) 62 (2005), no. 1, 55–72.zbMATHMathSciNetGoogle Scholar
  18. 18.
    M. B. Nathanson, Representation functions of bases for binary linear forms, Funct. Approx. Comment. Math. 37 (2007), 341–350.zbMATHMathSciNetGoogle Scholar
  19. 19.
    J. Neˇsetˇril and V. Rödl, Two proofs in combinatorial number theory, Proc. Amer. Math. Soc. 93 (1985), 185–188.CrossRefMathSciNetGoogle Scholar
  20. 20.
    C. Sándor, Partitions of natural numbers and their representation functions, Integers 4 (2004), A18, 5 pp. (electronic).Google Scholar
  21. 21.
    J. L. Selfridge and E. G. Straus, On the determination of numbers by their sums of a fixed order, Pacific J. Math. 8 (1958), 847–856.zbMATHMathSciNetGoogle Scholar
  22. 22.
    M. Tang and Y.-G. Chen, A basis of Z m, Colloq. Math. 104 (2006), no. 1, 99–103.Google Scholar

Copyright information

© Springer-Verlag New York 2008

Authors and Affiliations

  1. 1.Department of MathematicsLehman College (CUNY)Bronx
  2. 2.School of MathematicsInstitute for Advanced StudyPrinceton

Personalised recommendations