Numerical Partitions

Generate Numerical Partitions

What Type? (pick one)
All partitions of n [into k parts] [with largest part m] Partitions of n in Gray Code order [with largest part m] Partitions of n into distinct parts [with largest part m] Partitions of n into odd parts [with largest part m] Partitions of n into odd distinct parts [with largest part m] Binary partitions of n [with no part used more than k times] Score sequences of tournaments on n vertices Graphical partitions [with largest part at most k] Degree Sequences [with connectivity k = 0, 1, or 2]

What Type? (pick one)

All partitions of n [into k parts] [with largest part m]

Partitions of n in Gray Code order [with largest part m]

Partitions of n into distinct parts [with largest part m]

Partitions of n into odd parts [with largest part m]

Partitions of n into odd distinct parts [with largest part m]

Binary partitions of n [with no part used more than k times]

Score sequences of tournaments on n vertices

Graphical partitions [with largest part at most k]

Degree Sequences [with connectivity k = 0, 1, or 2]

Input (value 0 < n <= 50 required)
n =	k =	m =

Output (pick one or more)
Natural representation Multiplicity representation Ferrers Diagram Show corresponding partition under natural bijection (see Notes below). Show Gray code changes (if applicable)

Notes:

For graphical partitions n must be even.
Maximum allowed value of n is 50.

Questions?? Email The wizard of COS.

(Please note that the suffix XXXX must be removed from the preceeding email address.)
It was last updated Wednesday, 10-May-2006 10:32:13 PDT.
There have been 10086 visitors to this page since May 16, 2000 .
©Frank Ruskey, 1995-2003.