Results 1  10
of
42
Exact Enumeration Of 1342Avoiding Permutations A Close Link With Labeled Trees And Planar Maps
, 1997
"... Solving the first nonmonotonic, longerthanthree instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342avoiding permutations of length n as well as an exact formula for their number Sn (1342). While achieving this, we bijectively prove that the number of inde ..."
Abstract

Cited by 103 (8 self)
 Add to MetaCart
Solving the first nonmonotonic, longerthanthree instance of a classic enumeration problem, we obtain the generating function H(x) of all 1342avoiding permutations of length n as well as an exact formula for their number Sn (1342). While achieving this, we bijectively prove that the number of indecomposable 1342avoiding permutations of length n equals that of labeled plane trees of a certain type on n vertices recently enumerated by Cori, Jacquard and Schaeffer, which is in turn known to be equal to the number of rooted bicubic maps enumerated by Tutte in 1963. Moreover, H(x) turns out to be algebraic, proving the first nonmonotonic, longerthanthree instance of a conjecture of Zeilberger and Noonan. We also prove that n p Sn (1342) converges to 8, so in particular, limn!1 (Sn (1342)=Sn (1234)) = 0.
The Enumeration of Permutations with a Prescribed Number of "Forbidden" Patterns
 Adv. in Appl. Math
, 1998
"... We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always Precursive. We illustrate the method completely in terms of the patterns `abc',`cab' ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
(Show Context)
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always Precursive. We illustrate the method completely in terms of the patterns `abc',`cab' and `abcd'. 0.
Restricted permutations, continued fractions, and Chebyshev polynomials
 J. COMBIN
, 1999
"... Let fr n (k) be the number of 132avoiding permutations on n letters that contain exactly r occurrences of 12... k, and let Fr(x; k) and F(x,y; k) be the generating functions defined by Fr(x; k) = ∑ We find an explcit expression for F(x, y; k) in the form of a continued fraction. This allows us to ..."
Abstract

Cited by 46 (23 self)
 Add to MetaCart
(Show Context)
Let fr n (k) be the number of 132avoiding permutations on n letters that contain exactly r occurrences of 12... k, and let Fr(x; k) and F(x,y; k) be the generating functions defined by Fr(x; k) = ∑ We find an explcit expression for F(x, y; k) in the form of a continued fraction. This allows us to express Fr(x; k) for 1 � r � k via Chebyshev polynomials of the second kind. n�0 fr n (k)xn and F(x,y; k) = ∑ r�0 Fr(x; k)y r.
Permutations avoiding an increasing number of lengthincreasing forbidden subsequences
 Discrete Math. Theor. Comput. Sci
, 2000
"... A permutation is said to ¡ be –avoiding if it does not contain any subsequence having all the same pairwise comparisons ¡ as. This paper concerns the characterization and enumeration of permutations which avoid a set ¢¤ £ of subsequences increasing both in number and in length at the same time. Le ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
(Show Context)
A permutation is said to ¡ be –avoiding if it does not contain any subsequence having all the same pairwise comparisons ¡ as. This paper concerns the characterization and enumeration of permutations which avoid a set ¢¤ £ of subsequences increasing both in number and in length at the same time. Let ¢ £ be the set of subsequences of the “¥§¦©¨�������¦©¨����� � form ¥ ”, being any permutation ��������������¨� � on. ¨��� � For the only subsequence in ¢�� ���� � is and ���� � the –avoiding permutations are enumerated by the Catalan numbers; ¨��� � for the subsequences in ¢� � are, ������ � and the (������������������ � –avoiding permutations are enumerated by the Schröder numbers; for each other value ¨ of greater � than the subsequences in ¢ £ ¨� � are and their length ¦©¨����� � is; the permutations avoiding ¨�� these subsequences are enumerated by a number ������ � �� � � sequence such �������������� � that �� � , being � the –th Catalan number. For ¨ each we determine the generating function of permutations avoiding the subsequences in ¢� £ , according to the length, to the number of left minima and of noninversions.
Decomposing simple permutations, with enumerative consequences
, 2006
"... We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bóna and (independently) Mansour and Vainshtein that for any r, ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bóna and (independently) Mansour and Vainshtein that for any r, the number of permutations with at most r copies of 132 has an algebraic generating function.
Counting occurrences of 132 in a permutation
 Adv. Appl. Math
"... Abstract. We study the generating function for the number of permutations on n letters containing exactly r � 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r. ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We study the generating function for the number of permutations on n letters containing exactly r � 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r.
Enumeration of permutations containing a prescribed number of occurrences of a pattern of length 3
, 2001
"... We consider the problem of enumerating the permutations containing exactly k occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a f ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
(Show Context)
We consider the problem of enumerating the permutations containing exactly k occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an alternative approach to the problem, which yields a proof for a formula which so far only was conjectured (by Noonan and Zeilberger). This approach is based on bijections from permutations to certain lattice paths with “jumps”, which were first considered by Krattenthaler.
Permutations containing and avoiding certain patterns
 Proc. 12th Conference on Formal Power Series and Algebraic Combinatorics
, 2000
"... Let T m k = {σ ∈ Sk  σ1 = m}. We prove that the number of permutations which avoid all patterns in T m k equals (k − 2)!(k − 1)n+1−k for k ≤ n. We then prove that for any τ ∈ T 1 k (or any τ ∈ T k k), the number of permutations which avoid all patterns in T 1 k (or in T k k) except for τ and contai ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
(Show Context)
Let T m k = {σ ∈ Sk  σ1 = m}. We prove that the number of permutations which avoid all patterns in T m k equals (k − 2)!(k − 1)n+1−k for k ≤ n. We then prove that for any τ ∈ T 1 k (or any τ ∈ T k k), the number of permutations which avoid all patterns in T 1 k (or in T k k) except for τ and contain τ exactly once equals (n + 1 − k)(k − 1) n−k for k ≤ n. Finally, for any τ ∈ T m k, 2 ≤ m ≤ k − 1, this number equals (k − 1) n−k for k ≤ n. These results generalize recent results due to Robertson concerning permutations avoiding 123pattern and containing 132pattern exactly once. 1
Counting occurrences of some subword patterns
 Discr. Math. Theor. Comp. Sci
"... Abstract. We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of orderisomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified numbe ..."
Abstract

Cited by 19 (13 self)
 Add to MetaCart
(Show Context)
Abstract. We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of orderisomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3letter subword pattern. 1.
Continued fractions, statistics, and generalized patterns
, 2001
"... Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Following [BCS], let ekπ (respectively; fkπ) be the number of the occurrences of the generalized pattern 1 ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Following [BCS], let ekπ (respectively; fkπ) be the number of the occurrences of the generalized pattern 123...k (respectively; 213...k) in π. In the present note, we study the distribution of the statistics ekπ and fkπ in a permutation avoiding the classical pattern 132. Also we present an applications, which relates the Narayana numbers, Catalan numbers, and increasing subsequences, to permutations avoiding the classical pattern 132 according to a given statistics on ekπ, or on fkπ.