#noncrossing_partition

Noncrossing partition

In combinatorial mathematics, the topic of noncrossing partitions has assumed some importance because of its application to the theory of free probability. The number of noncrossing partitions of a set of n elements is the nth Catalan number. The number of noncrossing partitions of an n-element set with k blocks is found in the Narayana number triangle.

Mon 28th

Provided by Wikipedia

Learn More
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.