An infinite family of inv-Wilf-equivalent permutation pairs

DOI10.1016/j.ejc.2014.08.031zbMath1302.05001OpenAlexW2011032242MaRDI QIDQ472398

Justin H. C. Chan

Publication date: 19 November 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.031

zbMATH Keywords

pattern-avoiding permutationsBaxter-Jaggard conjectureinv-Wilf-equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric groups (20B30)

Related Items

Equidistribution of set-valued statistics on standard Young tableaux and transversals, Further refinements of Wilf-equivalence for patterns of length 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation patterns and statistics
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Pattern avoidance by even permutations
• Dyck paths and pattern-avoiding matchings
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Symmetric functions and P-recursiveness
• On a correspondence between binary trees and a certain type of permutation
• Forbidden subsequences
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• A new class of Wilf-equivalent permutations
• Generating trees and the Catalan and Schröder numbers
• Pattern avoidance in matchings and partitions
• Wilf-equivalence for singleton classes
• Crossings and nestings of matchings and partitions
• Operators of equivalent sorting power and related Wilf-equivalences
• Restricted permutations