Wilf classification of three and four letter signed patterns

DOI10.1016/j.disc.2007.06.013zbMath1169.05003arXivmath/0604025OpenAlexW2038755542MaRDI QIDQ932580

W. M. B. Dukes, Toufik Mansour, Astrid Reifegerste

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0604025

zbMATH Keywords

signed permutationsWilf equivalencepattern-avoiding permutationsforbidden subsequencessigned involutions

Mathematics Subject Classification ID

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

Related Items (1)

New equivalences for pattern avoiding involutions

Cites Work

• Forbidden subsequences
• Prefix exchanging and pattern avoidance by involutions
• A new class of Wilf-equivalent permutations
• Generating trees and the Catalan and Schröder numbers
• Classification of forbidden subsequences of length 4
• Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
• Signed involutions avoiding 2-letter signed patterns
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Restricted permutations
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent

This page was built for publication: Wilf classification of three and four letter signed patterns