Learn More
Let S n denote the symmetric group of all permutations of {1, 2,. .. , n} and let S = ∪ n≥0 S n. If Π ⊆ S is a set of permutations, then we let Av n (Π) be the set of permutations in S n which avoid every permutation of Π in the sense of pattern avoidance. One of the celebrated notions in pattern theory is that of Wilf-equivalence, where Π and Π are Wilf(More)
Guibert and Linusson introduced in [GL] the family of doubly alternating Baxter permutations, i.e. Baxter permutations σ ∈ Sn, such that σ and σ −1 are alternating. They proved that the number of such permutations in S 2n and S 2n+1 is the Catalan number Cn. In this paper we compute the expected limit shape of such permutations, following the approach by(More)
Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes and Ki-taev in their study of (2 + 2)-free posets. An ascent sequence of length n is a nonneg-ative integer sequence x = x 1 x 2. .. x n such that x 1 = 0 and x i asc(x 1 x 2. .. x i−1)+ 1 for all 1 < i n, where asc(x 1 x 2. .. x i−1) is the number of ascents in the sequence x 1 x 2. .. x(More)
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Inversion number Mahonian pair Major index q-analogue Statistic a b s t r a c t
  • 1