Longest alternating subsequences in pattern-restricted permutations.
Firro, Ghassan, Mansour, Toufik, Wilson, Mark C. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Firro, Ghassan, Mansour, Toufik, Wilson, Mark C. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Killpatrick, Kendra (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Novick, Mordechai (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Toufik Mansour, Mark Shattuck (2012)
Open Mathematics
Similarity:
In this paper, a direct combinatorial proof is given of a result on permutation pairs originally due to Carlitz, Scoville, and Vaughan and later extended. It concerns showing that the series expansion of the reciprocal of a certain multiply exponential generating function has positive integer coefficients. The arguments may then be applied to related problems, one of which concerns the reciprocal of the exponential series for Fibonacci numbers.
Zhao, Haijian, Zhong, Zheyuan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fulman, Jason (2005)
Electronic Journal of Probability [electronic only]
Similarity:
Khoroshkin, Anton, Shapiro, Boris (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Egge, Eric S., Mansour, Toufik (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vella, David C. (2008)
Integers
Similarity:
Adin, Ron M., Remmel, Jeffrey B., Roichman, Yuval (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bagno, Eli, Butman, Ayelet, Garber, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Andrews, George E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Toufik Mansour, Mark Shattuck (2011)
Open Mathematics
Similarity:
Let L n, n ≥ 1, denote the sequence which counts the number of paths from the origin to the line x = n − 1 using (1, 1), (1, −1), and (1, 0) steps that never dip below the x-axis (called Motzkin left factors). The numbers L n count, among other things, certain restricted subsets of permutations and Catalan paths. In this paper, we provide new combinatorial interpretations for these numbers in terms of finite set partitions. In particular, we identify four classes of the partitions of...