Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
gptkb:statistical_mechanics
computer science representation theory |
| gptkbp:complexity |
#P-complete
|
| gptkbp:defines |
the problem of writing a positive integer as a sum of positive integers, disregarding the order of the summands
|
| gptkbp:field |
gptkb:combinatorics
number theory |
| gptkbp:notableAchievement |
gptkb:Hardy–Ramanujan_asymptotic_formula
|
| gptkbp:notation |
p(n) denotes the number of partitions of n
|
| gptkbp:relatedConcept |
gptkb:Young_tableau
gptkb:Ferrers_diagram partition function |
| gptkbp:solvedBy |
generating functions
|
| gptkbp:studiedBy |
gptkb:Leonhard_Euler
|
| gptkbp:bfsParent |
gptkb:Coin_Change_Problem
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
integer partition problem
|