 Let formula_16 denote the set of increasing tableau with two rows of length "n",
and maximal entry formula_17.Then
formula_18
exhibit the cyclic sieving phenomenon, where formula_19 act via "K"-promotion.Let formula_20 be the set of permutations of cycle type "λ" and exactly "j" excedances.