Is there a closed-form formula for the Partition Function p(n)?

Click For Summary

Discussion Overview

The discussion revolves around the existence of a closed-form formula for the Partition Function p(n). Participants explore definitions of closed-form expressions, the nature of recursive formulas, and the implications of infinite sums in relation to closed forms.

Discussion Character

  • Debate/contested
  • Conceptual clarification
  • Mathematical reasoning

Main Points Raised

  • Some participants inquire whether a closed-form formula exists for the Partition Function p(n), emphasizing the need for clarity in the definition of "closed-form."
  • Several definitions of closed-form are discussed, with some participants arguing that it should not involve infinite sums or recursion.
  • One participant suggests that a closed-form expression should be a single arithmetic formula that simplifies an infinite sum.
  • Another participant challenges the notion that certain formulas containing infinite sums can be considered closed-form.
  • Some participants propose that a closed formula could be defined over a specific set of functions and operations, with constraints on the number of terms and dependence on n.
  • A link to an external source is provided, claiming to contain closed-form expressions, but this is contested by others who argue that the number of terms in those expressions depends on n.
  • There is a general sentiment that a definitive closed-form expression for p(n) may not exist, as indicated by multiple participants expressing uncertainty or disagreement on the topic.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the existence of a closed-form expression for the Partition Function p(n). There are multiple competing views regarding the definitions and implications of closed forms, as well as the nature of the formulas discussed.

Contextual Notes

Discussions about the definitions of closed-form expressions reveal limitations in understanding and agreement on what constitutes a closed form, particularly regarding the inclusion of infinite sums and recursion.

Izzhov
Messages
120
Reaction score
0
I am aware that there are several generator functions for the Partition Function p(n), but does anyone know if a closed form formula exists for this function?
 
Mathematics news on Phys.org
http://www.research.att.com/~njas/sequences/A000041 has a recursive formula:
[tex]p(n) = \frac1n\cdot\sum_{k=0}^{n-1}\sigma(n-k)\cdot p(k)[/tex]
 
Last edited by a moderator:
Thanks, but I put the words "closed-form" in italics for a reason.

...unless I'm mistaken on the definition of "closed-form." Which is quite possible.
 
So tell us what you mean by closed form. (No sigma, no recursion, only +-*/?)
 
I read the page you linked to, but I didn't see a definition.
 
"[A closed-form formula is] a single arithmetic formula obtained to simplify an infinite sum in a general formula." -Wikipedia
Basically, what you said. No infinite sums, recursion, etcetera.
 
Izzhov said:
"[A closed-form formula is] a single arithmetic formula obtained to simplify an infinite sum in a general formula." -Wikipedia

That doesn't tell me what it is at all. Further, I don't see what closed form formulas have to do with infinite sums.
 
CRGreathouse said:
That doesn't tell me what it is at all. Further, I don't see what closed form formulas have to do with infinite sums.
A closed-form formula is when you take a formula with an infinite sum, such as
[tex] s = \sum_{k=0}^\infty ar^k[/tex]
and simplify it to an algebraic formula, which in this case would be
[tex] s = \frac{a}{1 - r}[/tex]
(Assuming, in this case, that r < 1.)
Understand?
 
  • #11
Wait, but that has an infinite sum in it! That doesn't really count. :/
 
  • #12
Sure it counts. Just as the closed form for, say, sin(x) = x - x^3/3! + x^5/5! - ...

Perhaps the real question is, what do you want the closed form for? If you want to calculate values exactly, use the recurrence formula. To approximate it, use the asymptotic formula. But I assume you need the closed form for some other reason.
 
  • #13
This Wikipedia article on closed-form expressions is probably the one you're looking for, rather than the one Izzhov linked.

I wouldn't consider either of lrs5's examples to be in closed form, because both contain infinite sums.
 
  • #14
So I take it there actually is no closed-form expression then?
 
  • #15
Izzhov said:
A closed-form formula is when you take a formula with an infinite sum, such as
[tex] s = \sum_{k=0}^\infty ar^k[/tex]
and simplify it to an algebraic formula, which in this case would be
[tex] s = \frac{a}{1 - r}[/tex]
(Assuming, in this case, that r < 1.)
Understand?

In other words, you mean that the infinite series can/will converge.
 
  • #16
Not just converge, but converge to something that can be expressed with finitely many elementary operations (whatever they may be).
 
  • #17
Couldnt we define a closed formula p(n) over a set of functions (for example the elementary functions, or maybe only the functions f(x)=x, f(x)=c) combined with a certain set of operations (for example ^*/-+) as a formula whose number of terms (functions):
1) is not infinite
2) is not depending on n.
 
  • #18
Kurret said:
Couldnt we define a closed formula p(n) over a set of functions (for example the elementary functions, or maybe only the functions f(x)=x, f(x)=c) combined with a certain set of operations (for example ^*/-+) as a formula whose number of terms (functions):
1) is not infinite
2) is not depending on n.

I'd prefer to define it symbolically, perhaps with a context-free grammar:

F -> 0
F -> 1
F -> n
F -> -F
F -> F[tex]^{-1}[/tex]
F -> (F)+(F)
F -> (F)*(F)
F -> (F)^(F)
 
  • #19
  • #20
I don't see how that's closed form, since the number of terms depends on n, and is thus unbounded.
 
  • #21
Izzhov said:
I go by the Wikipedia definition.

Too bad this guy doesn't come around anymore... I was just starting to like him!

But seriously, forks.

I do NOT know of a closed-form equation.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 9 ·
Replies
9
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K