words, the finest partition that is coarser than both of two noncrossing partitions is not always the finest noncrossing partition that is coarser than...

partition can then be visualized by drawing each block as a polygon (whose vertices are the elements of the block). The partition is then noncrossing...

Multiplicative partition Noncrossing partition Ordered partition of a set Partition calculus Partition function (quantum field theory) Partition function (statistical...

of noncrossing partitions of the set {1, ..., n}. A fortiori, Cn never exceeds the n-th Bell number. Cn is also the number of noncrossing partitions of...

noncrossing partitions of the set { 1, ..., n } in the same way in which the classic cumulant functional is related to the lattice of all partitions of...

of the set of all partitions of a finite set in the theory of ordinary cumulants is replaced by the set of all noncrossing partitions of a finite set....

ISBN 978-3-540-77398-6, S2CID 117958873 Reading, Nathan (2010), "Noncrossing Partitions, Clusters and the Coxeter Plane", Séminaire Lotharingien de Combinatoire...

cumulants, one sums over all partitions of the set { 1, ..., n }. If instead, one sums only over the noncrossing partitions, then, by solving these formulae...

lattice if and only if it has at most one non-singleton part. The noncrossing partition lattice is similarly supersolvable, although it is not geometric...

Simian and Daniel Ullman (1991). "On the structure of the lattice of noncrossing partitions" (PDF). Discrete Mathematics. 98 (3): 193–206. doi:10.1016/0012-365X(91)90376-D...

pioneer in the study of permutation patterns, and an expert on noncrossing partitions. Simion was one of the top competitors in the Romanian national...

orthogonal design Packing problem Bin packing problem Partition of a set Noncrossing partition Permanent Permutation Enumerations of specific permutation classes...

A001764 (binomial(3*n,n)/(2*n+1) (enumerates ternary trees and also noncrossing trees))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation...

unit-distance graphs. Informally, matchstick graphs can be made by placing noncrossing matchsticks on a flat surface, hence the name. Much of the research on...

TL_{n}(\delta )} may be represented diagrammatically as the vector space over noncrossing pairings of 2 n {\displaystyle 2n} points on two opposite sides of a...

203–218. Rushbrooke, G S; Eve, J (1962). "High-temperature partition function and refated noncrossing polygons for the simple cubic lattice". Journal of Mathematical...