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 
.
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 
.
Details and Options
- To use PartitionLattice, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- The function takes two options: Type and VertexLabel, with default values Undirected and False, respectively.
- When Type is set to Directed, the function produces the underlying directed acyclic graph.
- When VertexLabel is set to True, labels are produced for the vertices.
Text
Wolfram Research (2012), PartitionLattice, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html.
CMS
Wolfram Language. 2012. "PartitionLattice." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html.
APA
Wolfram Language. (2012). PartitionLattice. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html