7 search results - page 1 / 2 » Enumeration of (k, 2)-noncrossing partitions |
70
Voted
DM
2008
14 years 9 months ago
2008
A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12
DAM
1998
14 years 9 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
ARSCOM
2002
14 years 9 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
60
Voted
JCT
2007
14 years 9 months ago
2007
In two previous papers, the study of partitions with short sequences has been developed both for its intrinsic interest and for a variety of applications. The object of this paper...
JCO
2006
14 years 9 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...