\(n\)-colour compositions (Q5928323): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:25, 30 January 2024
scientific article; zbMATH DE number 1582442
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(n\)-colour compositions |
scientific article; zbMATH DE number 1582442 |
Statements
\(n\)-colour compositions (English)
0 references
24 July 2001
0 references
Due to MacMahon an ordered partition (or a composition) of an integer is a partition where the order of the parts counts: the ordered partitions 1-2-1 and 1-1-2 are different. An \(n\)-colour partition is a partition where a part of size \(n\) may have \(n\) different colours. This paper studies \(n\)-colour compositions which are defined accordingly. The paper develops generating functions for \(n\)-colour compositions and for \(n\)-colour compositions into a given number of parts.
0 references
partitions of numbers
0 references
ordered partitions (compositions) of numbers
0 references
colour partitions
0 references
