PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH THREE
Permutation is said to contain a -pattern, if has at least a subsequence whose elements correspond with elements in . If there is no such subsequence in permutation , then is called -avoiding. A -pattern is said to have length three if consists of three elements. In this project, we review how t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/33554 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Permutation is said to contain a -pattern, if has at least a subsequence whose
elements correspond with elements in . If there is no such subsequence in
permutation , then is called -avoiding. A -pattern is said to have length three
if consists of three elements.
In this project, we review how to determine the number of permutations that avoid
pattern of length three. |
|---|