Add to ORKGThis article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
AbstractThe statistical physics approach to the number partioning problem, a classical NP-hard probl...
Several theoretical estimates of the distribution of the parts of integer partitions have been publi...
The class of minimal difference partitionsMDP(q) (with gap q) is defined by the condition that succe...
AbstractThe present paper deals with an apparently hitherto untreated problem in the theory of restr...
We compare different analytical and numerical methods for studying the partitions of a finite system...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
AbstractWe prove a central limit theorem for the number of different part sizes in a random integer ...
Paper presented at Strathmore International Math Research Conference on July 23 - 27, 201
We give series of recursive identities for the number of partitions with exactly $k$ parts and with ...
15 pagesWe consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fi...
15 pagesWe consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fi...
We give series of recursive identities for the number of partitions with exactly $k$ parts and with ...
The study of integer partitions has wide applications to mathematics, mathematical physics, and st...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
AbstractThe statistical physics approach to the number partioning problem, a classical NP-hard probl...
Several theoretical estimates of the distribution of the parts of integer partitions have been publi...
The class of minimal difference partitionsMDP(q) (with gap q) is defined by the condition that succe...
AbstractThe present paper deals with an apparently hitherto untreated problem in the theory of restr...
We compare different analytical and numerical methods for studying the partitions of a finite system...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
AbstractWe prove a central limit theorem for the number of different part sizes in a random integer ...
Paper presented at Strathmore International Math Research Conference on July 23 - 27, 201
We give series of recursive identities for the number of partitions with exactly $k$ parts and with ...
15 pagesWe consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fi...
15 pagesWe consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fi...
We give series of recursive identities for the number of partitions with exactly $k$ parts and with ...
The study of integer partitions has wide applications to mathematics, mathematical physics, and st...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
AbstractThe statistical physics approach to the number partioning problem, a classical NP-hard probl...
Several theoretical estimates of the distribution of the parts of integer partitions have been publi...