New equivalences for pattern avoiding involutions
From MaRDI portal
Publication:3604996
DOI10.1090/S0002-9939-08-09492-6zbMATH Open1169.05002OpenAlexW2033650648MaRDI QIDQ3604996FDOQ3604996
Authors: W. M. B. Dukes, Vít Jelínek, Toufik Mansour, Astrid Reifegerste 
Publication date: 25 February 2009
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-08-09492-6
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
signed permutationsWilf equivalencepattern avoiding permutationsforbidden subsequencespattern avoiding involutions
Cites Work
- Some combinatorial properties of Schubert polynomials
- Restricted permutations and Chebyshev polynomials
- Criterion for smoothness of Schubert varieties in Sl(n)/B
- Pattern avoidance and rational smoothness of Schubert varieties
- Sorting Using Networks of Queues and Stacks
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- A survey of stack-sorting disciplines
- Wilf-equivalence for singleton classes
- Title not available (Why is that?)
- Vexillary elements in the hyperoctahedral group
- The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
- Multi-static enumeration of two-stack sortable permutations
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Sorting twice through a stack
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Prefix exchanging and pattern avoidance by involutions
- Wilf classification of three and four letter signed patterns
- Avoiding maximal parabolic subgroups of \(S_k\)
- Equivalences for pattern avoiding involutions and classification
Cited In (13)
- Generating-tree isomorphisms for pattern-avoiding involutions
- On refinements of Wilf-equivalence for involutions
- Equidistribution of set-valued statistics on standard Young tableaux and transversals
- Equivalences for pattern avoiding involutions and classification
- 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)
