Add to ORKGWe provide enumerative results concerning right-to-left minima and left-to-right minima in Andre' permutations of the first and second kind. For both of the two kinds, the distribution of right-to-left and left-to-right minima is the same. We provide generating functions and associated asymptotic results. Our approach is based on the tree-structure of Andre' permutations
AbstractBouvel and Pergola introduced the notion of minimal permutations in the study of the whole g...
Summary: Given two operators D^ and E^ subject to the relation D^E^−qE^D^=p, and a word w in D^ and ...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
We provide enumerative results concerning right-to-left minima and left-to-right minima in Andre' p...
International audienceIn the recent paper, the authors provide enumerating results for equivalence c...
RésuméOn the set of minimax trees of a given order there can be defined two families of operations, ...
We study the iteration of the process "a particle jumps to the right" inpermutations. We prove that ...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
AbstractIn this paper we exploit binary tree representations of permutations to give a combinatorial...
Let the records of a permutation σ be its left-right minima, right-left minima, left-right maxima an...
In this paper we propose a new bijection between permutation tableaux and permutations. This bijecti...
none3siWe define a map between the set of permutations that avoid either the four patterns 3214, 324...
AbstractGiven two operators Dˆ and Eˆ subject to the relation DˆEˆ−qEˆDˆ=p, and a word w in Dˆ and E...
Abstract. Let Rn be the set of all permutations of length n which avoid 132. In this paper we study ...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
AbstractBouvel and Pergola introduced the notion of minimal permutations in the study of the whole g...
Summary: Given two operators D^ and E^ subject to the relation D^E^−qE^D^=p, and a word w in D^ and ...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...
We provide enumerative results concerning right-to-left minima and left-to-right minima in Andre' p...
International audienceIn the recent paper, the authors provide enumerating results for equivalence c...
RésuméOn the set of minimax trees of a given order there can be defined two families of operations, ...
We study the iteration of the process "a particle jumps to the right" inpermutations. We prove that ...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
AbstractIn this paper we exploit binary tree representations of permutations to give a combinatorial...
Let the records of a permutation σ be its left-right minima, right-left minima, left-right maxima an...
In this paper we propose a new bijection between permutation tableaux and permutations. This bijecti...
none3siWe define a map between the set of permutations that avoid either the four patterns 3214, 324...
AbstractGiven two operators Dˆ and Eˆ subject to the relation DˆEˆ−qEˆDˆ=p, and a word w in Dˆ and E...
Abstract. Let Rn be the set of all permutations of length n which avoid 132. In this paper we study ...
AbstractSeveral authors have examined connections among 132-avoiding permutations, continued fractio...
AbstractBouvel and Pergola introduced the notion of minimal permutations in the study of the whole g...
Summary: Given two operators D^ and E^ subject to the relation D^E^−qE^D^=p, and a word w in D^ and ...
The subject of pattern avoiding permutations has its roots in computer science, namely in the proble...