Skip to main content
SpringerLink
Log in

An extension of Nathanson’s Theorem on representation functions

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

For a given integer n and a set S ⊆ N denote by R h,S (1) the number of solutions of the equation \(n = {s_{{i_1}}} + ... + {s_{{i_h}}},{s_{{i_j}}} \in S,j = 1,...,h\). In this paper we determine all pairs (A;B), A,B ⊆ N for which R h,A (1)(n) = R h,B (1)(n) from a certain point on, where h is a power of a prime. We also discuss the composite case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yong-Gao Chen and Min Tang: Partitions of natural numbers with the same representation functions, Journal of Number Theory, 129 (2009), 2689–2695.

    Article  MathSciNet  MATH  Google Scholar 

  2. Yong-Gao Chen and Bin Wang: On additive properties of two special sequences, Acta Arithmetica, 110 (2003), 299–303.

    Article  MathSciNet  MATH  Google Scholar 

  3. G. Dombi: Additive properties of certain sets, Acta Arithmetica, 103 (2002), 137–146.

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Z. Kiss, E. Rozgonyi and Cs. Sándor: Sets with almost coinciding representation functions, Bulletin of the Australian Math. Soc., 89 (2014), 97–111.

    Article  MathSciNet  MATH  Google Scholar 

  5. L. Kronecker: Zwei sätse über Gleichungen mit ganzzahligen Coeffcienten, Journal für die Reine und Angewandte Mathematik, 53 (1857), 173–175.

    Article  Google Scholar 

  6. V. F. Lev: Reconstructing integer sets from their representation functions, Electronic Journal of Combinatorics, 11 (2004), R78.

    MathSciNet  MATH  Google Scholar 

  7. M. B. Nathanson: Representation functions of sequences in additive number theory, Proceedings of the American Mathematical Society, 72 (1978), 16–20.

    Article  MathSciNet  MATH  Google Scholar 

  8. Cs. Sándor: Partitions of natural numbers and their representation functions, Integers, 4 (2004), A18.

    MathSciNet  MATH  Google Scholar 

  9. M. T.: Partitions of the set of natural numbers and their representation functions, Discrete Mathematics, 308 (2008), 2614–2616.

    Article  MathSciNet  MATH  Google Scholar 

  10. Q.-H. Yang: Another Proof of Nathanson’s Theorems, Journal of Integer Sequences, 14 (2011).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Budapest University of Technology and Economics, Budapest, Hungary

    Eszter Rozgonyi & Csaba Sándor

  2. MTA-BME Stochastic Research Group, Budapest, Hungary

    Eszter Rozgonyi

Authors
  1. Eszter Rozgonyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Csaba Sándor
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eszter Rozgonyi.

Additional information

This author was supported by the OTKA Grant No. K109789.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rozgonyi, E., Sándor, C. An extension of Nathanson’s Theorem on representation functions. Combinatorica 37, 521–537 (2017). https://doi.org/10.1007/s00493-015-3311-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-015-3311-8

Mathematics Subject Classification (2000)

Search

Navigation