From recursions to asymptotics: on Szekeres' formula for the number of partitions

  title={From recursions to asymptotics: on Szekeres' formula for the number of partitions},
  author={E. Rodney Canfield},
  journal={Electr. J. Comb.},
We give a new proof of Szekeres’ formula for P (n, k), the number of partitions of the integer n having k or fewer positive parts. Our proof is based on the recursion satisfied by P (n, k) and Taylor’s formula. We make no use of the Cauchy integral formula or any complex variables. The derivation is presented as a step-by-step procedure, to facilitate its application in other situations. As corollaries we obtain the main term of the Hardy-Ramanujan formulas for p(n) = the number of unrestricted… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

Some asymptotic formulae in the theory of partitions (II), Quart

  • G. Szekeres
  • J. of Math. (Oxford)
  • 1953
Highly Influential
15 Excerpts

Asymptotic formulae in combinatory analysis

  • G. G. Hardy, S. Ramanujan
  • J. London Math. Society
  • 1918
Highly Influential
8 Excerpts

An asymptotic formula in the theory of partitions

  • R. L. Graham, M. Grötschel, L. Lovász
  • Asymptotic enumeration methods , in Handbook of…
  • 1995

Stirling number asymptotics from recursion equations using the ray method

  • C. Knessl, J. B. Keller
  • Studia Appl. Math
  • 1991
3 Excerpts

Partition asymptotics for recursion equations

  • C. Knessl, J. B. Keller
  • SIAM J. Appl. Math
  • 1990
3 Excerpts

Advanced Combinatorics, D

  • L. Comtet
  • Reidel,
  • 1974

and I

  • M. Abramowit
  • Stegun, Handbook of Mathematical Functions, Dover…
  • 1973
1 Excerpt

Similar Papers

Loading similar papers…