The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
From MaRDI portal
Publication:5935598
DOI10.1007/s003730070001zbMath0988.05008OpenAlexW2021848912MaRDI QIDQ5935598
Publication date: 23 January 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730070001
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items
Wilf-equivalence for singleton classes ⋮ Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization ⋮ Classical length-5 pattern-avoiding permutations ⋮ On (shape-)Wilf-equivalence for words ⋮ Principal specializations of Schubert polynomials and pattern containment ⋮ Restricted colored permutations and Chebyshev polynomials ⋮ Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux ⋮ Positional Marked Patterns in 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 ⋮ Equidistribution of set-valued statistics on standard Young tableaux and transversals ⋮ Wilf classification of three and four letter signed patterns ⋮ Supercritical sequences, and the nonrationality of most principal permutation classes ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ Explicit enumeration of 321, hexagon-avoiding permutations ⋮ A new class of Wilf-equivalent permutations
This page was built for publication: The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
