Abstract
Let A be a set of positive integers with gcd (A) = 1, and let p A (n) be the partition function of A. Let c 0 = π√2/3. If A has lower asymptotic density α and upper asymptotic density β, then lim inf log p A (n)/c 0 √n ≧ √α and lim sup log p A (n)/c 0 √n ≦ √β. In particular, if A has asymptotic density α > 0, then log p A (n) ∼ c0√αn. Conversely, if α > 0 and log p A (n) ∼ c 0 √αn, then the set A has asymptotic density α.
Similar content being viewed by others
References
G. E. Andrews, The Theory of Partitions Addison-Wesley (Reading, Mass., 1976).
P. Erdős, On an elementary proof of some asymptotic formulas in the theory of partitions, Annals Math. 43 (1942), 437–450.
G. H. Hardy and J. E. Littlewood, Tauberian theorems concerning power series and Dirichlet's series whose coefficients are positive, Proc. London Math. Soc. 13 (1914), 174–191.
G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. 17 (1918), 75–115.
M. B. Nathanson, On Erdős's elementary method in the asymptotic theory of partitions, Preprint, 1998.
M. B. Nathanson, Partitions with parts in a finite set, Proc. Amer. Math. Soc. (2000), to appear.
E. Netto, Lehrbuch der Kombinatorik Teubner (Leipzig, 1927).
A. Odlyzko, Asymptotic enumeration methods, in: Handbook of Combinatorics volume II, R. L. Graham, M. Grötschel, and L. Lovász, editors, North Holland (Amsterdam, 1995).
G. Pólya and G. Szegö, Aufgaben und Lehrsätze aus der Analysis Springer-Verlag (Berlin, 1925). English translation: Problems and Theorems in Analysis Springer-Verlag (New York, 1972).
E. C. Titchmarsh, The Theory of Functions Oxford University Press, 2nd edition (Oxford, 1939).
Ya. V. Uspensky, Asymptotic expressions of numerical functions occurring in problems concerning the partition of numbers into summands, Bull. Acad. Sci. de Russie 14 (1920), 199–218.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nathanson, M.B. Asymptotic Density and the Asymptotics of Partition Functions. Acta Mathematica Hungarica 87, 179–195 (2000). https://doi.org/10.1023/A:1006789419031
Issue Date:
DOI: https://doi.org/10.1023/A:1006789419031