Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



On the polynomial representation for the number of partitions with fixed length

Authors: So Ryoung Park, Jinsoo Bae, Hyun Gu Kang and Iickho Song
Journal: Math. Comp. 77 (2008), 1135-1151
MSC (2000): Primary 05A17; Secondary 11P81, 11P82
Published electronically: December 10, 2007
MathSciNet review: 2373195
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper, it is shown that the number $ M(n,k)$ of partitions of a nonnegative integer $ n$ with $ k$ parts can be described by a set of $ \widetilde{k}$ polynomials of degree $ k-1$ in $ Q_{\widetilde{k}}$, where $ \widetilde{k}$ denotes the least common multiple of the $ k$ integers $ 1, 2, \cdots, k$ and $ Q_{\widetilde{k}}$ denotes the quotient of $ n$ when divided by $ \widetilde{k}$. In addition, the sets of the $ \widetilde{k}$ polynomials are obtained and shown explicitly for $ k=3, 4, 5,$ and $ 6$.

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

  • 1. I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, New York: Academic, 1980.
  • 2. R. P. Grimaldi, Discrete and Combinatorial Mathematics, Third Ed., Reading: Addison-Wesley, 1994.
  • 3. Mathematical Society of Japan, Encyclopedic Dictionary of Mathematics, Second. Ed., Vol. III, Cambridge: MIT Press, 1986.
  • 4. I. Niven, H. S. Zuckerman, and H. L. Montgomery, An Introduction to the Theory of Numbers, Fifth Ed., New York: John Wiley and Sons, 1991. MR 1083765 (91i:11001)
  • 5. K. H. Rosen, J. G. Michaels, J. L. Gross, J. W. Grossman, and D. R. Shier, Handbook of Discrete and Combinatorial Mathematics, New York: CRC, 2000. MR 1725200 (2000g:05001)
  • 6. N. J. A. Sloane and S. Plouffe, Encyclopedia of Integer Sequences, San Diego: Academic, 1995. MR 1327059 (96a:11001)
  • 7. R. P. Stanley, Enumerative Combinatorics, Vols. 1 and 2, Cambridge: Cambridge University Press, 1997. MR 1442260 (98a:05001)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 05A17, 11P81, 11P82

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

Additional Information

So Ryoung Park
Affiliation: School of Information, Communications, and Electronics Engineering, The Catholic University of Korea, Bucheon 420-743 Korea

Jinsoo Bae
Affiliation: Department of Information and Communication Engineering, Sejong University, Seoul 143-747 Korea

Hyun Gu Kang
Affiliation: Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology, Daejeon 305-701 Korea

Iickho Song
Affiliation: Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology, Daejeon 305-701 Korea

Keywords: Partition, polynomial representation, nonrecursive formula
Received by editor(s): March 9, 2007
Published electronically: December 10, 2007
Additional Notes: This study was supported by the National Research Laboratory (NRL) Program of Korea Science and Engineering Foundation (KOSEF), Ministry of Science and Technology (MOST), under Grant R0A-2005-000-10005-0, for which the authors would like to express their thanks. The authors also wish to express their appreciation of the constructive suggestions and helpful comments from the anonymous reviewers.
Article copyright: © Copyright 2007 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society