Counting permutations by their rigid patterns
From MaRDI portal
Publication:696917
DOI10.1006/jcta.2002.3279zbMath1006.05008OpenAlexW2102040169MaRDI QIDQ696917
Publication date: 12 September 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/39c6e9e9038e6e44e03187372b3cd2c23f743e8e
Related Items
A new metric on symmetric groups and applications to block permutation codes, Where the monotone pattern (mostly) rules, A discrete probability problem in card shuffling, New theoretical bounds and constructions of permutation codes under block permutation metric, From Hertzsprung's problem to pattern-rewriting systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Permutation patterns and continued fractions
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Classification of forbidden subsequences of length 4
- Restricted permutations