Inversion formulae on permutations avoiding 321

MaRDI QIDQ895062zbMATH OpenFDO

Authors Pingge Chen, Zhousheng Mei, Suijie Wang

Publication date 26 November 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p28

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Catalan numbergenerating functionpattern avoidanceDyck path

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Inversion polynomials for 321-avoiding permutations
• Inversions in 312-permutations
• Lagrange inversion counts \(3\overline5241\)-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

Cites work

• 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?)
• 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
• 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

Cited in

(9)

• The operators \(F_i\) on permutations, 132-avoiding permutations and inversions
• 321-avoiding affine permutations and their many heaps
• On a recurrence related to 321 -- avoiding permutations
• Rowmotion on 321-avoiding permutations
• Inversion polynomials for 321-avoiding permutations
• Lagrange inversion counts \(3\overline5241\)-avoiding permutations
• Inversions in 312-permutations
• Unimodal permutations and almost-increasing cycles
• Pattern avoidance and Young tableaux

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)