J. Noonan and D. Zeilberger, The enumeration of permutations with a prescribed number of "forbidden" patterns, Adv. in Appl. Math 17 (1996), 381-407. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exact Enumeration Of 1342-Avoiding Permutations A Close Link With.. - Bona (1997) (5 citations) (Correct)
....recently 2 stack sortable permutations have been shown to be equinumerous to nonseparable planar maps [6] 7] Examining the generating function H(x) we will prove and disprove several conjectures for the pattern 1342. H(x) turns out to be algebraic, proving a conjecture of Zeilberger and Noonan [19] for the first time for a nonmonotonic pattern which is longer than three. We will see that n p S n (1342) 8, which disproves a conjecture of Stanley and implies the surprising fact that lim n 1 (S n (1342) S n (1234) 0. 1.2. Definitions and Background. In what follows permutations of ....
....of them. Recently, attention has been paid to the problem of counting the number of permutations of length n containing a given number r (as opposed to 0) of subsequences of a certain type q. The major problem of this field is to describe this function for any given r, not just for r = 0. In [19] Noonan and Zeilberger conjectured that for any given subsequence q and for any given r, the number of n permutations containing exactly r subsequences of type q is a P recursive function of n. Present author has proved this conjecture for any r when q = 132. Beyond the case of length 3, ....
D. Zeilberger, J. Noonan, The enumeration of permutations with a prescribed number of "forbidden" subsequences, Advances in Applied Mathematics, 17 (1996), 381-407.
Permutations Avoiding Two Patterns of Length Three - Vatter (2003) (Correct)
No context found.
J. Noonan and D. Zeilberger, The enumeration of permutations with a prescribed number of "forbidden" patterns, Adv. in Appl. Math 17 (1996), 381-407.
Counting Occurrences Of A Pattern Of Type (1,2) or (2,1) in.. - Claesson, Mansour (2002) (Correct)
No context found.
J. Noonan and D. Zeilberger. The enumeration of permutations with a prescribed number of "forbidden" patterns. Adv. in Appl. Math., 17(4):381--407, 1996.
Permutations Avoiding Two Patterns of Length Three - Department (Correct)
No context found.
J. Noonan and D. Zeilberger, The enumeration of permutations with a prescribed number of \forbidden" patterns, Adv. in Appl. Math 17 (1996), 381-407.
Counting Occurences of 132 in an Even Permutation - Mansour (2004) (Correct)
No context found.
J. Noonan and D. Zeilberger. The enumeration of permutations with a prescribed number of "forbidden" patterns. Adv. in Appl. Math., 17(4):381--407, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC