Inversion formulae on permutations avoiding 321

zbMath1326.05004MaRDI QIDQ895062

Zhousheng Mei, Pingge Chen, 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

zbMATH Keywords

Catalan number; generating function; Dyck path; pattern avoidance

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A05: Permutations, words, matrices

Related Items

Pattern avoidance and Young tableaux, Unimodal permutations and almost-increasing cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inversion polynomials for 321-avoiding permutations
• Permutation patterns and statistics
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• Bijections for refined restricted permutations
• Mahonian pairs
• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• The maximal-inversion statistic and pattern-avoiding permutations
• On a correspondence between binary trees and a certain type of permutation
• Some combinatorial properties of Schubert polynomials
• A weight-preserving bijection between Schröder paths and Schröder permutations
• A generalization of Simion-Schmidt's bijection for restricted permutations
• Motzkin paths and reduced decompositions for permutations with forbidden patterns
• A simple and unusual bijection for Dyck paths and its consequences
• Generating trees and the Catalan and Schröder numbers
• Dyck paths and restricted permutations
• Classification of bijections between 321- and 132-avoiding permutations
• Restricted permutations
• Permutations with restricted patterns and Dyck paths