Wilf-equivalence for singleton classes
From MaRDI portal
Publication:2643864
DOI10.1016/j.aam.2004.11.006zbMath1127.05002OpenAlexW2015106956WikidataQ60638477 ScholiaQ60638477MaRDI QIDQ2643864
Julian West, Guoce Xin, Jörgen Backelin
Publication date: 27 August 2007
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2004.11.006
permutationspermutation matricesYoung diagramsbijectionsWilf equivalenceforbidden subsequencesforbidden matrices
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)
Related Items
Wilf equivalence relations for consecutive patterns ⋮ New records in Stanley-Wilf limits ⋮ Classical length-5 pattern-avoiding permutations ⋮ Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes ⋮ On (shape-)Wilf-equivalence for words ⋮ Permutations avoiding certain patterns: The case of length 4 and some generalizations ⋮ Avoiding a pair of patterns in multisets and compositions ⋮ Partial permutations avoiding pairs of patterns ⋮ Shape-Wilf-equivalences for vincular patterns ⋮ Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux ⋮ On pattern avoiding alternating permutations ⋮ Ascent-descent Young diagrams and pattern avoidance in alternating permutations ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ On refinements of Wilf-equivalence for involutions ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes ⋮ Equidistribution of set-valued statistics on standard Young tableaux and transversals ⋮ Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Modified growth diagrams, permutation pivots, and the BWX map \(\phi ^{\ast}\) ⋮ Pattern avoidance in matchings and partitions ⋮ Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ A new class of multiset Wilf equivalent pairs ⋮ Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices ⋮ Fillings of skew shapes avoiding diagonal patterns ⋮ Large deviations for permutations avoiding monotone patterns ⋮ \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams ⋮ On a refinement of Wilf-equivalence for permutations ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Increasing and decreasing sequences in fillings of moon polyominoes ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns ⋮ Another look at bijections for pattern-avoiding permutations ⋮ New equivalences for pattern avoiding involutions ⋮ The solution of a conjecture of Stanley and Wilf for all layered patterns ⋮ Explicit enumeration of 321, hexagon-avoiding permutations ⋮ On bijections for pattern-avoiding permutations ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Classical and consecutive pattern avoidance in rooted forests ⋮ k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams ⋮ Maximal increasing sequences in fillings of almost-moon polyominoes ⋮ A new class of Wilf-equivalent permutations
Cites Work
- Forbidden subsequences
- A new class of Wilf-equivalent permutations
- Generating trees and the Catalan and Schröder numbers
- Classification of forbidden subsequences of length 4
- Generating trees and forbidden subsequences
- Restricted permutations
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
