Inversion formulae on permutations avoiding 321
Summary: 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 \[ |\mathcal S_{n,m}(321)|=\sum_{b\vdash m}\binom{n-\frac{\Delta(b)}{2}}{l(b)}. \] where the sum runs over all compositions \(b=(b_1,b_2,\ldots,b_k)\) of \(m\), i.e., \[ m=b_1+b_2+\cdots+b_k\,\,\text{and}\,\,b_i\geqslant 1, \] \(l(b)=k\) is the length of \(b\), and \(\Delta(b):=|b_1|+|b_2-b_1|+\cdots+|b_k-b_{k-1}|+|b_k|\). We obtain a new bijection from 321-avoiding permutations to Dyck paths which establishes a relation on inversion number of 321-avoiding permutations and valley height of Dyck paths.
- Inversion polynomials for 321-avoiding permutations
- Inversions in 312-permutations
- Lagrange inversion counts 35241-avoiding permutations
- Inversion polynomials for permutations avoiding consecutive patterns
- On a recurrence related to 321 -- avoiding permutations
- scientific article; zbMATH DE number 4012618
- Permutations with inversions
- Fixed points of 321-avoiding permutations
- Inversion generating functions for signed pattern avoiding permutations
- A generalization of Simion-Schmidt's bijection for restricted permutations
- A simple and unusual bijection for Dyck paths and its consequences
- A weight-preserving bijection between Schröder paths and Schröder permutations
- Bijections for refined restricted permutations
- Classification of bijections between 321- and 132-avoiding permutations
- Descent sets on 321-avoiding involutions and hook decompositions of partitions
- Dyck paths and restricted permutations
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 4168687 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Inversion polynomials for 321-avoiding permutations
- Mahonian pairs
- Motzkin paths and reduced decompositions for permutations with forbidden patterns
- On a correspondence between binary trees and a certain type of permutation
- Permutation patterns and statistics
- Permutations with restricted patterns and Dyck paths
- Refining enumeration schemes to count according to the inversion number
- Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
- Restricted permutations
- Some combinatorial properties of Schubert polynomials
- The maximal-inversion statistic and pattern-avoiding permutations
- 321-avoiding affine permutations and their many heaps
- The operators F_i on permutations, 132-avoiding permutations and inversions
- Unimodal permutations and almost-increasing cycles
- Lagrange inversion counts 35241-avoiding permutations
- On a recurrence related to 321 -- avoiding permutations
- Inversion polynomials for 321-avoiding permutations
- Pattern avoidance and Young tableaux
- Inversions in 312-permutations
- Rowmotion on 321-avoiding permutations
This page was built for publication: Inversion formulae on permutations avoiding 321
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895062)
