Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N)

Details Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N) Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N)

2004-04-22

arxiv.org/abs/math-ph/0404050v1

Physics

Mathematical Physics

25 pages, submitted to The Electronic Journal of Combinatorics

Scientific paper

A recent paper examined the global structure of integer partitions sequences and, via combinatorial analysis using modular arithmetic, derived a closed form expression for a map from (N, M) to the set of all partitions of a positive integer N into exactly M positive integer summands. The output of the IPS map was a "matrix" having M columns and a number of rows equal to p[N, M], the number of partitions of N into M parts. The global structure of integer partition sequences (IPS) is that of a complex tree. In this paper, we examine the structure of the IPS tree and, by counting the number of directed paths through the tree, obtain a simple formula which gives, in closed form, the total number of partitions of N into exactly M parts. By summing over M, we obtain a transparent alternative to the Hardy-Ramanujan-Rademacher formula for p(N).

Affiliated with

Also associated with

No associations

Rating

Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple alternative to the Hardy-Ramanujan-Rademacher formula for p(N) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662163