Decomposing an Integer N into All Sets of J Positive Integer Summands by Simulation of Dynamically Varying Nested DO Loops

DOI10.1111/1467-9876.00089zbMATH Open0904.05009OpenAlexW1993326607MaRDI QIDQ4390939FDOQ4390939

Publication date: 2 August 1998

Published in: Journal of the Royal Statistical Society Series C: Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1467-9876.00089

zbMATH Keywords

partitions Fortran algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

This page was built for publication: Decomposing an Integer N into All Sets of J Positive Integer Summands by Simulation of Dynamically Varying Nested DO Loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390939)