Add to ORKGWe study V- and ^-patterns which generalize valleys and peaks, as well as increasing and decreasing runs, in permutations. A complete classi¯cation of permutations (multi)-avoiding V- and ¤-patterns of length 4 is given. We also establish a connection between restricted permutations and matchings in the coronas of complete graphs
International audienceInspired by the definition of the barred pattern-avoiding permutation, we intr...
Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requi...
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per r...
Recently, Babson and Steingrımsson have introduced generalized permutation patterns that allow the r...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
AbstractRecently, Babson and Steingrı́msson have introduced generalized permutation patterns ...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
AbstractProving and disproving some earlier conjectures, we give a characterization of the numbers o...
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
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...
International audienceInspired by the definition of the barred pattern-avoiding permutation, we intr...
Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requi...
International audienceInspired by the definition of the barred pattern-avoiding permutation, we intr...
Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requi...
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per r...
Recently, Babson and Steingrımsson have introduced generalized permutation patterns that allow the r...
Interesting patterns are everywhere we look, but what happens when we try to avoid patterns? A permu...
AbstractRecently, Babson and Steingrı́msson have introduced generalized permutation patterns ...
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoid...
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
AbstractProving and disproving some earlier conjectures, we give a characterization of the numbers o...
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is...
International audienceWe explore the classical pattern avoidance question in the case of irreducible...
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...
International audienceInspired by the definition of the barred pattern-avoiding permutation, we intr...
Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requi...
International audienceInspired by the definition of the barred pattern-avoiding permutation, we intr...
Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requi...
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per r...