Topics
computer programBook
We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reducible 1324-avoiding permutations and the number of {1324, 4132, 2413, 3241}-avoiding permutations. By studying the generating tree for all 1324-avoiding permutations,we obtain a recurrence formula for their number. A computer program provides data for thenumber of 1324-avoiding permutations of length up to 20
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
A complete structural description and enumeration is found for permutations that avoid both 1324 and...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-patter...
We show that the counting sequence for permutations avoiding both of the (clas-sical) patterns 1243 ...
AbstractSolving the first nonmonotonic, longer-than-three instance of a classic enumeration problem,...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
We confirm a conjecture of Lara Pudwell and show that permutations of [n] that avoid the barred patt...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
A complete structural description and enumeration is found for permutations that avoid both 1324 and...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
In this paper we study the family of permutations avoiding the pattern 122+3 (trivially equivalent t...
We give an improved algorithm for counting the number of 1324-avoiding permu-tations, resulting in 5...
We prove that the number of permutations which avoid 132-patterns and have exactly one 123-patter...
We show that the counting sequence for permutations avoiding both of the (clas-sical) patterns 1243 ...
AbstractSolving the first nonmonotonic, longer-than-three instance of a classic enumeration problem,...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
We confirm a conjecture of Lara Pudwell and show that permutations of [n] that avoid the barred patt...
AbstractWe exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijectio...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
A complete structural description and enumeration is found for permutations that avoid both 1324 and...
Add to ORKG