Add to ORKGWe determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its left. We use this characterisation to establish the generating function enumerating these permutations. We also investigate the properties of a typical large permutation in the class and prove that if a large permutation that avoids 4213 and 2143 is chosen uniformly at random, then it is more likely than not to avoid 2413 as well
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in ea...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
We characterise those permutation classes whose simple permutations are monotone griddable. This cha...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
We determine the structure of permutations avoiding the patterns 4213 and2143. Each such permutation...
We enumerate the pattern class Av(2143, 4231) and completely describe its permutations. The main too...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
A complete structural description and enumeration is found for permutations that avoid both 1324 and...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in ea...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combin...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in ea...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
We characterise those permutation classes whose simple permutations are monotone griddable. This cha...
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutatio...
We determine the structure of permutations avoiding the patterns 4213 and2143. Each such permutation...
We enumerate the pattern class Av(2143, 4231) and completely describe its permutations. The main too...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
We investigate the structure of the two permutation classes defined by the sets of forbidden pattern...
A complete structural description and enumeration is found for permutations that avoid both 1324 and...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in ea...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
There is a deep connection between permutations and trees. Certain sub-structures of permutations, c...
The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combin...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in ea...
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards un...
We characterise those permutation classes whose simple permutations are monotone griddable. This cha...