Combinatorica Package >

PartitionLattice

PartitionLattice[n]
returns a Hasse diagram of the partially ordered set on set partitions of through in which if is finer than , that is, each block in is contained in some block in .
  • When is set to Directed, the function produces the underlying directed acyclic graph.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF