A partition function computes the number of ways an integer $n$ can be represented as the sum of $m$ other integers. For some value $n$, we have a partition function $p(n)$.

These were studied extensively in mathematics by MacMahon, Hardy, Littlewood and Ramanujan. Rademacher provided a way to approximating $p(n)$, improving on a formula by hardy and Littlewood. More recently, K. Ono and A. Wiles have come up with new interesting results.

Are there applications of partition functions in Computer Sciences, perhaps in the theory of elliptic curve cryptography or complexity?

| cite | improve this question | | | | |
  • $\begingroup$ Definitely not in elliptic curve cryptography. $\endgroup$ – Yuval Filmus Aug 9 '14 at 2:46
  • $\begingroup$ They might come in algorithm analysis, sure. $\endgroup$ – Raphael Aug 9 '14 at 12:21
| cite | improve this answer | | | | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.