[Information Index] [Generation Index] [COS homepage]

Generate Numerical Partitions

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

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

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


Notes:
[Information Index] [Generation Index] [COS homepage]

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 9051 visitors to this page since May 16, 2000 .
©Frank Ruskey, 1995-2003.