Algorithmic approach to counting of certain types \(m\)-ary partitions.

DOI10.1016/S0012-365X(03)00096-7zbMath1077.05008MaRDI QIDQ1420584

Valentin P. Bakoev

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(m\)-ary partition algorithmAlgebraic and combinatorial propertiesBoolean cube partitionFull \(m\)-ary treeRecurrence table

Mathematics Subject Classification ID

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

Related Items

On arithmetic properties of binary partition polynomials

Uses Software

• OEIS

Cites Work

• Congruence properties of the \(m\)-ary partition function
• Accurate estimation of the number of binary partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item