Add to ORKGWe show that the counting sequence for permutations avoiding both of the (clas-sical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences
We determine the structure of permutations avoiding the patterns 4213 and2143. Each such permutation...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
We show that the counting sequence for permutations avoiding both of the(classical) patterns 1243 an...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reduci...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-patter...
International audienceWe give the generating function for the integer sequence enumerating a class o...
International audienceWe give the generating function for the integer sequence enumerating a class o...
We confirm a conjecture of Lara Pudwell and show that permutations of [n] that avoid the barred patt...
AbstractBaxter studied a particular class of permutations by considering fixed points of the composi...
We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
We determine the structure of permutations avoiding the patterns 4213 and2143. Each such permutation...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
We show that the counting sequence for permutations avoiding both of the(classical) patterns 1243 an...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reduci...
AbstractWe study generating functions for the number of permutations on n letters avoiding 132 and a...
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-patter...
International audienceWe give the generating function for the integer sequence enumerating a class o...
International audienceWe give the generating function for the integer sequence enumerating a class o...
We confirm a conjecture of Lara Pudwell and show that permutations of [n] that avoid the barred patt...
AbstractBaxter studied a particular class of permutations by considering fixed points of the composi...
We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
We determine the structure of permutations avoiding the patterns 4213 and2143. Each such permutation...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...