Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

Partitions with parts in a finite set


Author: Melvyn B. Nathanson
Journal: Proc. Amer. Math. Soc. 128 (2000), 1269-1273
MSC (2000): Primary 11P81; Secondary 05A17, 11B34
Published electronically: February 7, 2000
MathSciNet review: 1705753
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract:

Let $A$ be a nonempty finite set of relatively prime positive integers, and let $p_A(n)$ denote the number of partitions of $n$ with parts in $A$. An elementary arithmetic argument is used to prove the asymptotic formula

\begin{displaymath}p_A(n) = \left(\frac{1}{\prod_{a\in A}a}\right) \frac{n^{k-1}}{(k-1)!} + O\left( n^{k-2}\right). \end{displaymath}


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2000): 11P81, 05A17, 11B34

Retrieve articles in all journals with MSC (2000): 11P81, 05A17, 11B34


Additional Information

Melvyn B. Nathanson
Affiliation: Department of Mathematics, Lehman College (CUNY), Bronx, New York 10468
Address at time of publication: School of Mathematics, Institute for Advanced Study, Princeton, New Jersey 08540
Email: nathansn@alpha.lehman.cuny.edu, nathansn@ias.edu

DOI: http://dx.doi.org/10.1090/S0002-9939-00-05606-9
PII: S 0002-9939(00)05606-9
Keywords: Partition functions, asymptotics of partitions, additive number theory
Received by editor(s): June 5, 1998
Published electronically: February 7, 2000
Additional Notes: This work was supported in part by grants from the PSC–CUNY Research Award Program and the NSA Mathematical Sciences Program.
Communicated by: David E. Rohrlich
Article copyright: © Copyright 2000 American Mathematical Society