#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2002

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- William Y. C. Chen, Eva Yu-Ping Deng, Rosena R. X. Du
- Eur. J. Comb.
- 2005

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)

- Toufik Mansour, Eva Yu-Ping Deng, Rosena R. X. Du
- Discrete Applied Mathematics
- 2006

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)

- William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. Yang
- Electr. J. Comb.
- 2002

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)

- Eva Yu-Ping Deng, Toufik Mansour
- Discrete Applied Mathematics
- 2008

In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indices related to ternary paths and k-ary paths. © 2007 Elsevier B.V. All rights reserved. MSC: 10A35; 65Q05; 05.10

- William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. Yang
- Discrete Mathematics
- 2008

Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and (321, 31̄42)-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schröder numbers.

- Eva Yu-Ping Deng, Wei-Jun Yan
- Discrete Applied Mathematics
- 2008

- Eva Yu-Ping Deng, Mark Dukes, Toufik Mansour, Susan Y. J. Wu
- Discrete Mathematics
- 2009

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)

Abstract: In this paper, we study symmetric lattice paths. Let dn, mn, and sn denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schröder paths of length 2n, respectively. By using Riordan group methods we obtain six identities relating dn, mn, and sn and also give two of them combinatorial proofs. Finally, we investigate some… (More)

- ‹
- 1
- ›