Inversion Formulae on Permutations Avoiding 321
نویسندگان
چکیده
We will study the inversion statistic of 321-avoiding permutations, and obtain that the number of 321-avoiding permutations on [n] with m inversions is given by
منابع مشابه
Inversion polynomials for 321-avoiding permutations
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin...
متن کاملInversion polynomials for 321-avoiding permutations: addendum
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.
متن کاملMotzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 31̄42)-avoiding permutations in terms of their canonical reduced decompositions. This characterization is used to construct a bijection for a recent result that the number of (321, 31̄42)-avoiding permutations of length n equals the n-th Motzkin number, due to Gire, and further studied by Barcucci, Del Lungo, Pergola, Pinzani and Guibert. Similarly, we obtain...
متن کاملExcedances and Descents of Bi-increasing Permutations
Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...
متن کاملAn Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations
The symmetric q, t-Catalan polynomial Cn(q, t), which specializes to the Catalan polynomial Cn(q) when t = 1, was defined by Garsia and Haiman in 1994. In 2000, Garsia and Haglund proved the existence of statistics a(π) and b(π) on Dyck paths such that Cn(q, t) = P π qt where the sum is over all n × n Dyck paths. Specializing t = 1 gives Cn(q) = P π q and specializing q = 1 as well gives the us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015