A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions

DOI10.1007/s10852-009-9116-2zbMath1228.05050OpenAlexW2121972922WikidataQ60691994 ScholiaQ60691994MaRDI QIDQ655178

John Douglas Opdyke

Publication date: 2 January 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-009-9116-2

zbMATH Keywords

algorithmFibonacciinteger partitionsPascal's triangleinteger compositionsbounded partitionsbounded compositions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Number-theoretic algorithms; complexity (11Y16) Analytic theory of partitions (11P82) Calculation of integer sequences (11Y55)

Related Items (4)

Generalized algorithm for restricted weak composition generation ⋮ New algorithms and analyses for sum-preserving encryption ⋮ A direct calculation of moments of the sample variance ⋮ Algorithms for enumeration problem of linear congruence modulo \(m\) as sum of restricted partition numbers

Uses Software

• GraphBase
• OEIS
• SumTools

Cites Work

• A structured program to generate all topological sorting arrangements
• A Gray code for compositions
• Fast algorithms for genegrating integer partitions
• A problem of restricted partitions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions