partition; non-decreasing list of positive integers
The conjpart(p) command computes and returns the conjugate partition of p.
A partition p=[i1,i2,...,im] of a positive integer n may be represented visually by its Ferrer's diagram. This is a diagram composed of dots in rows, in which the kth row consists of ik dots, for k=1..m. The total number of dots in the diagram is equal to the number n. For example, the partition 2,3,5 of 10 has the Ferrer's diagram:
consisting of ten dots arranged in three rows, with two dots in the first row, three dots in the second, and five dots in the third row.
Two partitions (of a positive integer n) are said to be conjugates if their Ferrer's diagrams are conjugate, which means that one is obtained from the other, by reflection along the anti-diagonal, by writing the rows as columns and columns as rows. For example, the conjugate of the Ferror diagram above is:
which represents the partition 1,1,2,3,3. Therefore, the partitions 2,3,5 and 1,1,2,3,3 are conjugate partitions.
Download Help Document
What kind of issue would you like to report? (Optional)