New equivalences for pattern avoiding involutions

DOI10.1090/S0002-9939-08-09492-6zbMath1169.05002OpenAlexW2033650648MaRDI QIDQ3604996

Vít Jelínek, W. M. B. Dukes, Astrid Reifegerste, Toufik Mansour

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

zbMATH Keywords

signed permutationsWilf equivalencepattern avoiding permutationsforbidden subsequencespattern avoiding involutions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (7)

Unnamed Item ⋮ Counting covered fixed points and covered arcs in an involution ⋮ On refinements of Wilf-equivalence for involutions ⋮ Equidistribution of set-valued statistics on standard Young tableaux and transversals ⋮ Generating-tree isomorphisms for pattern-avoiding involutions ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Stable characters from permutation patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting twice through a stack
• Criterion for smoothness of Schubert varieties in Sl(n)/B
• Wilf classification of three and four letter signed patterns
• Vexillary elements in the hyperoctahedral group
• Pattern avoidance and rational smoothness of Schubert varieties
• Some combinatorial properties of Schubert polynomials
• The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group
• Multi-static enumeration of two-stack sortable permutations
• Prefix exchanging and pattern avoidance by involutions
• A survey of stack-sorting disciplines
• Symmetry and unimodality in \(t\)-stack sortable permutations
• Restricted permutations and Chebyshev polynomials
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Wilf-equivalence for singleton classes
• New equivalences for pattern avoiding involutions
• Sorting Using Networks of Queues and Stacks
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations

This page was built for publication: New equivalences for pattern avoiding involutions