Visitar URL original
Set Partition -- from Wolfram MathWorld
TOPICS
Search

Set Partition


A set partition of a set S is a collection of disjoint nonempty subsets of S whose union is S. The number of set partitions of the set {k}_(k=1)^n is called a Bell number.

A noncrossing partition additionally respects a fixed cyclic ordering: the convex hulls of its set blocks, drawn on a circle, are disjoint.


See also

Bell Number, Complete Bell Polynomial, Noncrossing Partition, Partial Bell Polynomial, Partition, Restricted Growth String, Riordan Number, Set Block, Stirling Number of the Second Kind

Explore with Wolfram|Alpha

References

Ruskey, F. "Info About Set Partitions." https://web.archive.org/web/20130628091506/http://www.theory.csc.uvic.ca/~cos/inf/setp/SetPartitions.html.

Referenced on Wolfram|Alpha

Set Partition

Cite this as:

Weisstein, Eric W. "Set Partition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SetPartition.html

Subject classifications