Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations t
โฆ LIBER โฆ
Restricted Dumont Permutations
โ Scribed by Alexander Burstein
- Book ID
- 105764701
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 139 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Restricted permutations
โ
M.D. Atkinson
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 615 KB
Restricted Symmetric Permutations
โ
Eric S. Egge
๐
Article
๐
2007
๐
Springer
๐
English
โ 375 KB
Restricted 132-Avoiding Permutations
โ
Toufik Mansour; Alek Vainshtein
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 104 KB
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation ฯ on k letters, or containing ฯ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.
Restricted permutations and queue jumpin
โ
M.H. Albert; R.E.L. Aldred; M.D. Atkinson; H.P. van Ditmarsch; C.C. Handley; D.A
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 159 KB
Restricted colored permutations and Cheb
โ
Eric S. Egge
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 180 KB
Lexicographic permutations with restrict
โ
Donald E Knuth
๐
Article
๐
1979
๐
Elsevier Science
๐
English
โ 727 KB