10 search results - page 2 / 2 » Partitioning Posets |
JCT
2011
12 years 12 months ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
EJC
2006
13 years 5 months ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
COMBINATORICS
1999
13 years 4 months ago
1999
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
COMBINATORICS
2000
13 years 4 months ago
2000
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...