Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

Details Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

2011-08-22

arxiv.org/abs/1108.4391v2

Mathematics

Combinatorics

Scientific paper

The purpose of this short article is to announce, and briefly describe, a
Maple package, PARTITIONS, that (inter alia) completely automatically
discovers, and then proves, explicit expressions (as sums of quasi-polynomials)
for pm(n) for any desired m. We do this to demonstrate the power of "rigorous
guessing" as facilitated by the quasi-polynomial ansatz.

Affiliated with

Also associated with

No associations

Rating

Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) 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 Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-176770