Combinatorica Package >

PartitionLattice

PartitionLattice[n]
returns a Hasse diagram of the partially ordered set on set partitions of 1 through n in which p<q if q is finer than p, that is, each block in q is contained in some block in p.
  • When Type is set to Directed, the function produces the underlying directed acyclic graph.
© 2008 Wolfram Research, Inc. japanese.gif
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team