Advertisement

The Combinatorics of MacMahon’s Partial Fractions

  • Andrew V. SillsEmail author
Article
  • 12 Downloads

Abstract

MacMahon showed that the generating function for partitions into at most k parts can be decomposed into a partial fraction-type sum indexed by the partitions of k. In the present work, a generalization of MacMahon’s result is given, which in turn provides a full combinatorial explanation.

Keywords

Partitions Partition function Compositions Symmetric group 

Mathematics Subject Classification

Primary 05A17 

Notes

Acknowledgements

The author thanks George Andrews for pointing out [3, p. 209, Ex. 1], which leads to the research culminating in this paper. The author thanks Matthew Katz for his interest and useful suggestions. The author particularly thanks Robert Schneider for discussions and encouragement of this project over a long period of time, and for carefully reading and offering concrete suggestions to improve earlier versions of the manuscript. Finally, the author is extremely grateful to the editor and anonymous referees for carefully reading the manuscript, catching errors, offering numerous helpful suggestions, and for their kind patience as the author prepared revisions.

References

  1. 1.
    Andrews, G.E.: Some new partition theorems. J. Combin. Theory 2, 431–436 (1967)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Andrews, G.E.: Partition identities. Adv. Math. 9, 10–51 (1972)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Andrews, G.E.: The theory of partitions. Cambridge University Press, Cambridge (1998)zbMATHGoogle Scholar
  4. 4.
    Cayley, A.: Researches on the partition of numbers. Phil. Trans. Royal Soc. London 146, 127–144 (1856)CrossRefGoogle Scholar
  5. 5.
    Cayley, A.: The Collected Mathematical Papers. Cambridge University Press, Cambridge (1896)zbMATHGoogle Scholar
  6. 6.
    Fine, N.J.: Basic Hypergeometric Series and Applications. Mathematical Surveys and Monographs, Vol. 27. American Mathematical Society, Providence, RI (1988) CrossRefGoogle Scholar
  7. 7.
    MacMahon, P.A.: Combinatory Analysis, vol. II, Cambridge University Press (1916); Reissued (with volumes I and II bound in one volume), AMS Chelsea (2001)Google Scholar
  8. 8.
    Munagi, A.O.: Computation of \(q\)-partial fractions. Integers 7, #A25 (2007)Google Scholar
  9. 9.
    Munagi, A.O.: The Rademacher conjecture and \(q\)-partial fractions. Ramanujan J 15(3), 339–347 (2008)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Rademacher, H.: Topics in Analytic Number Theory. Die Grundlehren der mathematischen Wissenschaften, Band 169. Springer-Verlag, New York-Heidelberg (1973)Google Scholar
  11. 11.
    Schneider, R.: Eulerian series, zeta functions, and the arithmetic of partitions. Ph.D. Thesis. Emory University, Atlanta (2018)Google Scholar
  12. 12.
    Sagan, B.: The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions. Second Edition. Springer-Verlag, New York (2001)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Mathematical SciencesGeorgia Southern UniversityStatesboroUSA

Personalised recommendations