On refinements of Wilf-equivalence for involutions
From MaRDI portal
Publication:6116561
DOI10.1007/s10801-023-01239-1zbMath1518.05003arXiv2212.01800MaRDI QIDQ6116561
Lintong Wang, Robin D. P. Zhou, Sherry H. F. Yan
Publication date: 18 July 2023
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01800
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)
Related Items (2)
Equidistribution of set-valued statistics on standard Young tableaux and transversals ⋮ Further refinements of Wilf-equivalence for patterns of length 4
Cites Work
- Unnamed Item
- Unnamed Item
- On Wilf equivalence for alternating permutations
- On pattern avoiding alternating permutations
- Generating trees and pattern avoidance in alternating permutations
- Alternating permutations with restrictions and standard Young tableaux
- Restricted involutions and Motzkin paths
- Alternating permutations and symmetric functions
- The Cauchy identity for \(Sp(2n)\)
- Alternating, pattern-avoiding permutations
- Enumeration of bilaterally symmetric 3-noncrossing partitions
- Restricted 132-alternating permutations and Chebyshev polynomials
- Prefix exchanging and pattern avoidance by involutions
- On a family of conjectures of Joel Lewis on alternating permutations
- Pattern avoidance for alternating permutations and Young tableaux
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Wilf-equivalence for singleton classes
- Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
- Crossings and nestings of matchings and partitions
- New equivalences for pattern avoiding involutions
- Restricted permutations
- The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
- Pattern avoiding alternating involutions
This page was built for publication: On refinements of Wilf-equivalence for involutions
