Algorithmic approach to counting of certain types \(m\)-ary partitions.
From MaRDI portal
Publication:1420584
DOI10.1016/S0012-365X(03)00096-7zbMath1077.05008MaRDI QIDQ1420584
Publication date: 2 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
\(m\)-ary partition algorithm; Algebraic and combinatorial properties; Boolean cube partition; Full \(m\)-ary tree; Recurrence table
05A15: Exact enumeration problems, generating functions
05A17: Combinatorial aspects of partitions of integers
Related Items
Uses Software
Cites Work