Refined Restricted Inversion Sequences
نویسندگان
چکیده
Recently, the study of patterns in inversion sequences was initiated by Corteel–Martinez–Savage–Weselcouch and Mansour–Shattuck independently. Motivated their works a double Eulerian equidistribution due to Foata (1977), we investigate several classical statistics on restricted that are either known or conjectured be enumerated Catalan, Large Schröder, Baxter Euler numbers. One two highlights our results is fascinating bijection between 000-avoiding Simsun permutations, which together with Foata’s V- S-codes, provide proof equidistribution. The other one refinement conjecture Martinez Savage cardinality $${\mathbf{I}}_n(\ge ,\ge ,>)$$ n-th number, proved via so-called obstinate kernel method developed Bousquet-Mélou.
منابع مشابه
Refined restricted involutions
Define I n(α) to be the set of involutions of {1, 2, . . . , n} with exactly k fixed points which avoid the pattern α ∈ Si, for some i ≥ 2, and define I n(∅;α) to be the set of involutions of {1, 2, . . . , n} with exactly k fixed points which contain the pattern α ∈ Si, for some i ≥ 2, exactly once. Let in(α) be the number of elements in I k n(α) and let i k n(∅;α) be the number of elements in...
متن کاملRefined Restricted Permutations
Define Sk n(α) to be the set of permutations of {1, 2, . . . ,n} with exactly k fixed points which avoid the pattern α∈ Sm. Let sn(α) be the size of Sk n(α). We investigate S0 n(α) for all α∈ S3 as well as show that sn(132) = s k n(213) = s k n(321) and s k n(231) = s k n(312) for all 0 ≤ k ≤ n.
متن کاملRefined Inversion Statistics on Permutations
We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the non-inversions of a permutation). We also provide a distribution function for non-inversion sums, a distribution function for k-step inversions that relates to...
متن کاملBijections for refined restricted permutations
We present a bijection between 321and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson et al. (Ann. Combin. 6 (2003) 427), and Elizalde (Proc. FPSAC 2003). We also show that our bijection preserves additional statistics, which extends the
متن کاملInversion-descent polynomials for restricted permutations
We derive generating functions for a variety of distributions of joint permutation statistics all of which involve a bound on the maximum drop size of a permutation π, i.e., max{i−π(i)}. Our main result treats the case for the joint distribution of the number of inversions, the number of descents and the maximum drop size of permutations on [n] = {1, 2, . . . , n}. A special case of this (ignor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2021
ISSN: ['0219-3094', '0218-0006']
DOI: https://doi.org/10.1007/s00026-021-00550-7