Counting permutations by their rigid patterns
From MaRDI portal
(Redirected from Publication:696917)
Recommendations
Cites work
- scientific article; zbMATH DE number 3695198 (Why is no real title available?)
- Classification of forbidden subsequences of length 4
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutation patterns and continued fractions
- Restricted permutations
- The On-Line Encyclopedia of Integer Sequences
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- The solution of a conjecture of Stanley and Wilf for all layered patterns
Cited in
(11)- A counting scheme and some algebraic properties of a class of special permutation patterns
- New theoretical bounds and constructions of permutation codes under block permutation metric
- A discrete probability problem in card shuffling
- Stacking Blocks and Counting Permutations
- A new metric on symmetric groups and applications to block permutation codes
- From Hertzsprung's problem to pattern-rewriting systems
- scientific article; zbMATH DE number 3908439 (Why is no real title available?)
- scientific article; zbMATH DE number 2186873 (Why is no real title available?)
- Where the monotone pattern (mostly) rules
- scientific article; zbMATH DE number 5163456 (Why is no real title available?)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
This page was built for publication: Counting permutations by their rigid patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696917)