An infinite family of inv-Wilf-equivalent permutation pairs

DOI10.1016/J.EJC.2014.08.031zbMATH Open1302.05001OpenAlexW2011032242MaRDI QIDQ472398FDOQ472398

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

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

zbMATH Keywords

pattern-avoiding permutationsBaxter-Jaggard conjectureinv-Wilf-equivalence

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

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

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)