Inversion polynomials for 321-avoiding permutations
From MaRDI portal
Abstract: 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 paths, polyominoes, and continued fractions.
Recommendations
Cites work
- scientific article; zbMATH DE number 3695547 (Why is no real title available?)
- scientific article; zbMATH DE number 3604907 (Why is no real title available?)
- A simple and unusual bijection for Dyck paths and its consequences
- A weight-preserving bijection between Schröder paths and Schröder permutations
- Area of Catalan paths on a checkerboard
- Bijections for refined restricted permutations
- Combinatorial aspects of continued fractions
- Dyck paths and restricted permutations
- Fixed points and excedances in restricted permutations
- Inversion polynomials for 321-avoiding permutations
- Mahonian pairs
- Motzkin paths and reduced decompositions for permutations with forbidden patterns
- Multiple pattern avoidance with respect to fixed points and excedances
- On a recurrence related to 321 -- avoiding permutations
- 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
- Some permutations with forbidden subsequences and their inversion number
- The maximal-inversion statistic and pattern-avoiding permutations
- Two element lattice permutation numbers and their \(q\)-generalization
- q-Catalan numbers
Cited in
(23)- The operators \(F_i\) on permutations, 132-avoiding permutations and inversions
- Descent sets on 321-avoiding involutions and hook decompositions of partitions
- The combinatorics of normal subgroups in the unipotent upper triangular group
- A new encoding of permutations by Laguerre histories
- Restricted growth function patterns and statistics
- 321-avoiding affine permutations and their many heaps
- On a recurrence related to 321 -- avoiding permutations
- On some modules supported in the Chow variety
- Families of major index distributions: closed forms and unimodality
- Eulerian polynomials and excedance statistics
- Permutation patterns and statistics
- Set partition patterns and the dimension index
- On -positive polynomials arising in pattern avoidance
- \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon
- Inversion polynomials for 321-avoiding permutations
- Wave linked partitions and 312-avoiding permutations with primacy being 1
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- Major index over descent for pattern-avoiding permutations
- Inversion polynomials for permutations avoiding consecutive patterns
- On 1212-avoiding restricted growth functions
- Eulerian polynomials and excedance statistics via continued fractions
- Inversion formulae on permutations avoiding 321
- scientific article; zbMATH DE number 2127715 (Why is no real title available?)
This page was built for publication: Inversion polynomials for 321-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393921)
