New equivalences for pattern avoiding involutions
From MaRDI portal
Publication:3604996
Recommendations
- Equivalences for pattern avoiding involutions and classification
- Wilf classification of three and four letter signed patterns
- An infinite family of inv-Wilf-equivalent permutation pairs
- On refinements of Wilf-equivalence for involutions
- The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
Cites work
- scientific article; zbMATH DE number 1536136 (Why is no real title available?)
- A survey of stack-sorting disciplines
- Avoiding maximal parabolic subgroups of \(S_k\)
- Criterion for smoothness of Schubert varieties in Sl(n)/B
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Equivalences for pattern avoiding involutions and classification
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Multi-static enumeration of two-stack sortable permutations
- Pattern avoidance and rational smoothness of Schubert varieties
- Prefix exchanging and pattern avoidance by involutions
- Restricted permutations and Chebyshev polynomials
- Some combinatorial properties of Schubert polynomials
- Sorting Using Networks of Queues and Stacks
- Sorting twice through a stack
- Symmetry and unimodality in \(t\)-stack sortable permutations
- The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
- Vexillary elements in the hyperoctahedral group
- Wilf classification of three and four letter signed patterns
- Wilf-equivalence for singleton classes
Cited in
(13)- Generating-tree isomorphisms for pattern-avoiding involutions
- On refinements of Wilf-equivalence for involutions
- Equivalences for pattern avoiding involutions and classification
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- On pattern avoidance in matchings and involutions
- The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
- Combinatorics of exterior peaks on pattern-avoiding symmetric transversals
- Counting permutations with no long monotone subsequence via generating trees and the kernel method
- Stable characters from permutation patterns
- Counting covered fixed points and covered arcs in an involution
- Wilf classification of three and four letter signed patterns
- New Wilf-equivalence results for vincular patterns
- Longest increasing subsequences in involutions avoiding patterns of length three
This page was built for publication: New equivalences for pattern avoiding involutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604996)
