AbstractSeveral authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to give generating functions for involutions which avoid 3412 and various additional patterns. We express these generating functions in terms of Chebyshev polynomials of the second kind
Chebyshev polynomials have several elegant combinatorial interpretations. Specificially, the Chebysh...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
AbstractWe call a Stieltjes continued fraction with monic monomial numerators a Catalan continued fr...
AbstractWe study bivariate generating functions for the number of involutions in Sn subject to two r...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
Several authors have examined connections between restricted permutations and Chebyshev polynomials ...
AbstractSeveral authors have examined connections between restricted permutations and Chebyshev poly...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type conti...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
Chebyshev polynomials have several elegant combinatorial interpretations. Specificially, the Chebysh...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
AbstractWe call a Stieltjes continued fraction with monic monomial numerators a Catalan continued fr...
AbstractWe study bivariate generating functions for the number of involutions in Sn subject to two r...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
Several authors have examined connections between restricted permutations and Chebyshev polynomials ...
AbstractSeveral authors have examined connections between restricted permutations and Chebyshev poly...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type conti...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
Chebyshev polynomials have several elegant combinatorial interpretations. Specificially, the Chebysh...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
AbstractWe call a Stieltjes continued fraction with monic monomial numerators a Catalan continued fr...