125 research outputs found

    New interpretations for noncrossing partitions of classical types

    Get PDF
    We interpret noncrossing partitions of type BB and type DD in terms of noncrossing partitions of type AA. As an application, we get type-preserving bijections between noncrossing and nonnesting partitions of type BB, type CC and type DD which are different from those in the recent work of Fink and Giraldo. We also define Catalan tableaux of type BB and type DD, and find bijections between them and noncrossing partitions of type BB and type DD respectively.Comment: 21 pages, 15 figures, final versio

    Chain enumeration of kk-divisible noncrossing partitions of classical types

    Get PDF
    We give combinatorial proofs of the formulas for the number of multichains in the kk-divisible noncrossing partitions of classical types with certain conditions on the rank and the block size due to Krattenthaler and M{\"u}ller. We also prove Armstrong's conjecture on the zeta polynomial of the poset of kk-divisible noncrossing partitions of type AA invariant under a 180180^\circ rotation in the cyclic representation.Comment: 23 pages, 9 figures, final versio

    Promotion and Rowmotion

    Get PDF
    We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two disjoint chains and recent work of D. Armstrong, C. Stump, and H. Thomas on root posets and noncrossing partitions. We apply this bijection to several classes of posets, obtaining equivariant bijections to various known objects under rotation. We extend the same idea to give an equivariant bijection between alternating sign matrices under rowmotion and under B. Wieland's gyration. Finally, we define two actions with related orders on alternating sign matrices and totally symmetric self-complementary plane partitions.Comment: 25 pages, 22 figures; final versio

    Relations between cumulants in noncommutative probability

    Full text link
    We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of the formula for classical cumulants in terms of monotone cumulants whose coefficients are only partially computed.Comment: 27 pages, 7 figures, AMS LaTe
    corecore