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
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Several authors have examined connections between restricted permutations and Chebyshev polynomials ...
AbstractWe study bivariate generating functions for the number of involutions in Sn subject to two r...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
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...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Several authors have examined connections between restricted permutations and Chebyshev polynomials ...
AbstractWe study bivariate generating functions for the number of involutions in Sn subject to two r...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
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...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractBabson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced...
AbstractIn (West, Discrete Math. 157 (1996) 363–374) it was shown using transfer matrices that the n...
AbstractWe say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
We find a generating function expressed as a continued fraction that enumerates ordered trees by the...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...