Algorithmic approach to counting of certain types \(m\)-ary partitions. (Q1420584)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic approach to counting of certain types \(m\)-ary partitions. |
scientific article; zbMATH DE number 2035862
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic approach to counting of certain types \(m\)-ary partitions. |
scientific article; zbMATH DE number 2035862 |
Statements
Algorithmic approach to counting of certain types \(m\)-ary partitions. (English)
0 references
2 February 2004
0 references
\(m\)-ary partition algorithm
0 references
Recurrence table
0 references
Algebraic and combinatorial properties
0 references
Full \(m\)-ary tree
0 references
Boolean cube partition
0 references
