Eva Yu-Ping Deng

Learn More
In this paper, we present a reduction algorithm which transforms m-regular partitions of [n] = {1, 2, . . . , n} to (m−1)-regular partitions of [n − 1]. We show that this algorithm preserves the noncrossing property. This yields a simple explanation of an identity due to Simion-Ullman and Klazar in connection with enumeration problems on noncrossing(More)
This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321) and Sn(231), respectively. We also discuss permutations in Sn avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity(More)
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduced decompositions. This characterization is used to construct a bijection for a recent result that the number of (321, 31̄42)-avoiding permutations of length n equals the n-th Motzkin number, due to Gire, and further studied by Barcucci, Del Lungo, Pergola,(More)
Let Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns Ak. We present a bijection between symmetric Schröder paths of length 2n and involutions of length n + 1 avoiding A4. Statistics such as the number of right-to-left maxima and fixed points of the(More)
  • 1