Operators of equivalent sorting power and related Wilf-equivalences

zbMath1298.05005MaRDI QIDQ463051

Mathilde Bouvel, Michael Henry Albert

Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p11

zbMATH Keywords

sortingenumerationpermutationbijectionstackWilf-equivalence

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (1)

A general theory of Wilf-equivalence for Catalan structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching for permutations
• Permutation patterns and statistics
• Patterns in permutations and words.
• Sorting twice through a stack
• Describing West-3-stack-sortable permutations with permutation patterns
• A general theory of Wilf-equivalence for Catalan structures
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Sorted and/or sortable permutations
• Restricted permutations, continued fractions, and Chebyshev polynomials
• Simple permutations and pattern restricted permutations
• Classification of bijections between 321- and 132-avoiding permutations
• Sorting and preimages of pattern classes
• Sorting Using Networks of Queues and Stacks
• Operators of equivalent sorting power and related Wilf-equivalences
• Restricted permutations
• Restricted 132-avoiding permutations

This page was built for publication: Operators of equivalent sorting power and related Wilf-equivalences