An infinite family of inv-Wilf-equivalent permutation pairs

DOI10.1016/J.EJC.2014.08.031MaRDI QIDQ472398zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Permutation statistics and multiple pattern avoidance
• On refinements of Wilf-equivalence for involutions
• Pattern avoidance by even permutations
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Partial permutations avoiding pairs of patterns

Cites work

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

Cited in

(8)

• New equivalences for pattern avoiding involutions
• Equidistribution of set-valued statistics on standard Young tableaux and transversals
• On a refinement of Wilf-equivalence for permutations
• On refinements of Wilf-equivalence for involutions
• Further refinements of Wilf-equivalence for patterns of length 4
• Wilf equivalences between vincular patterns in inversion sequences
• A new class of Wilf-equivalent permutations
• Decreasing subsequences in permutations and Wilf equivalence for involutions

This page was built for publication: An infinite family of inv-Wilf-equivalent permutation pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472398)