Log in

An asymptotic formula for the logarithm of generalized partition functions

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

Abstract

Let \(\Lambda =\{ \lambda _j\}_{j=1}^\infty \) be a set of positive integers, and let \(p_\Lambda (n)\) be the number of ways of writing n as a sum of positive integers \(\lambda \in \Lambda \) such that \(\chi (\lambda )=1\) and \(f(\lambda ) \equiv j \,\,(\mathrm {mod}\,\, m)\), where \(m\ge 1\) and \(j\ge 0\) are fixed integers. Here, \(\chi \) and f are a certain multiplicative function and an additive function, respectively. In this paper, we obtain the asymptotic formula for \(\ln \left( \sum _{n\le x} p_\Lambda (n) \right) \sim \ln p_\Lambda ([x])\) as \(x\rightarrow \infty \).

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Thailand)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bateman, P.T.: The distribution of values of the Euler function. Acta Arith. 21, 329–345 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  2. Delange, H.: Sur des formules de Atle Selberg. Acta Arith. 19, 105–146 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 17, 75–115 (1918)

    Article  MATH  Google Scholar 

  4. Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Clarendon Press, Oxford (1979)

    MATH  Google Scholar 

  5. Ingham, A.E.: A Tauberian theorem for partitions. Ann. Math. 42, 1075–1090 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  6. Nazaikinskii, V.E.: On the asymptotics of the number of states for the Bose-Maslov gas. Math. Notes 91(5–6), 816–823 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Odlyzko, A.M.: Asymptotic enumeration methods. In: Graham, R.L. (ed.) Handbook of Combinatorics, vol. 2, pp. 1063–1229. Elsevier, Amsterdam (1995)

    Google Scholar 

  8. Selberg, A.: Note on a paper by L. G. Sathe. J. Indian Math. Soc. 18, 83–87 (1954)

    MathSciNet  MATH  Google Scholar 

  9. Tenenbaum, G.: Introduction to Analytic and Probabilistic Number Theory. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  10. Wirsing, E.: Das asymptotische Verhalten von Summen uber multiplikative Funktionen, II. Acta Math. Acad. Sci. Hung. 18, 411–467 (1967)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The author would like to thank Professor Toyokazu Hiramatsu for his encouragements and thoughtful suggestions. The author also would like to thank the referee for his or her valuable comments and careful review of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Seiken Saito.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The author was partially supported by JSPS KAKENHI Grant Number 16K05259.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saito, S. An asymptotic formula for the logarithm of generalized partition functions. Ramanujan J 49, 39–53 (2019). https://doi.org/10.1007/s11139-018-0088-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11139-018-0088-6

Keywords

Mathematics Subject Classification

Navigation