Stable equivalence over symmetric functions.
Noncrossing trees and noncrossing graphs.
Minimally intersecting set partitions of type B.
The skew and relative derangements of type B.
Permutation tableaux and the dashed permutation pattern 32-1.
Motzkin paths and reduced decompositions for permutations with forbidden patterns.
Hook length formulas for trees by Han's expansion.
Derangement polynomials and excedances of type .
On Stanley's partition function.
Ratio monotonicity of polynomials derived from nondecreasing sequences.
A bijection between atomic partitions and unsplitable partitions.
Matchings avoiding partial patterns.
BG-ranks and 2-cores.
Crossings and nestings in tangled diagrams.
Efficient counting and asymptotics of -noncrossing tangled diagrams.
Identities derived from noncrossing partitions of type .
Page 1