AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind
AbstractBaxter studied a particular class of permutations by considering fixed points of the composi...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractWe study the generating function for the number of permutations on n letters containing exac...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
We show that the counting sequence for permutations avoiding both of the (clas-sical) patterns 1243 ...
AMS Subject Classication: 05A05, 05A15, 30B70, 42C05 Dedicated to the memory of Gian-Carlo Rota Abst...
We study the generating function for the number of even (or odd) permutations on n letters containin...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractBaxter studied a particular class of permutations by considering fixed points of the composi...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
AbstractWe study generating functions for the number of even (odd) permutations on n letters avoidin...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractWe study the generating function for the number of permutations on n letters containing exac...
A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: (k + 1)(k + 2)(k + ...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
Abstract. We study generating functions for the number of involutions of length n avoiding (or conta...
We show that the counting sequence for permutations avoiding both of the (clas-sical) patterns 1243 ...
AMS Subject Classication: 05A05, 05A15, 30B70, 42C05 Dedicated to the memory of Gian-Carlo Rota Abst...
We study the generating function for the number of even (or odd) permutations on n letters containin...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
AbstractBaxter studied a particular class of permutations by considering fixed points of the composi...
AbstractWe study generating functions for the number of n-long k-ary words that avoid both 132 and a...
AbstractSeveral authors have examined connections among restricted permutations, continued fractions...
DOI
Add to ORKG