A new class of Wilf-equivalent permutations

DOI10.1023/A:1015016625432zbMath1005.05002arXivmath/0103152OpenAlexW1500943703MaRDI QIDQ1604771

Julian West, Zvezdelina E. Stankova

Publication date: 8 July 2002

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

Full work available at URL: https://arxiv.org/abs/math/0103152

zbMATH Keywords

permutationWilf-equivalent

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (22)

Wilf equivalence relations for consecutive patterns ⋮ Wilf-equivalence for singleton classes ⋮ Classical length-5 pattern-avoiding permutations ⋮ On (shape-)Wilf-equivalence for words ⋮ Sorting with networks of data structures ⋮ 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 ⋮ Wilf equivalences for patterns in rooted labeled forests ⋮ Further refinements of Wilf-equivalence for patterns of length 4 ⋮ Pattern avoidance in matchings and partitions ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ Wilf classification of three and four letter signed patterns ⋮ Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices ⋮ Fillings of skew shapes avoiding diagonal patterns ⋮ \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Explicit enumeration of 321, hexagon-avoiding permutations ⋮ Classical and consecutive pattern avoidance in rooted forests ⋮ k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Criterion for smoothness of Schubert varieties in Sl(n)/B
• On a correspondence between binary trees and a certain type of permutation
• The solution of a conjecture of Stanley and Wilf for all layered patterns
• Forbidden subsequences
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Posets of matrices and permutations with forbidden subsequences
• Asymptotic values for degrees associated with strips of Young diagrams
• Generating trees and the Catalan and Schröder numbers
• Classification of forbidden subsequences of length 4
• Generating trees and forbidden subsequences
• Permutations, matrices, and generalized Young tableaux
• Wilf-equivalence for singleton classes
• Restricted permutations
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations

This page was built for publication: A new class of Wilf-equivalent permutations