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 
.
更多信息和选项
- 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.
文本
Wolfram Research (2012)，PartitionLattice，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html.
CMS
Wolfram 语言. 2012. "PartitionLattice." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html.
APA
Wolfram 语言. (2012). PartitionLattice. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/PartitionLattice.html 年