PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR
Permutation is called to contain a pattern , if has at least a subsequence whose elements correspond with elements of . Let be a permutation with c and d as four entries in (that follow in this order from left to right, but are not necessarily consecutive). If , then is called form a -pattern. I...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/33557 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:33557 |
|---|---|
| spelling |
id-itb.:335572019-01-24T14:32:14ZPERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR Tarakolo, Seplin Matematika Indonesia Theses permutation, two-stack sortable permutation. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/33557 Permutation is called to contain a pattern , if has at least a subsequence whose elements correspond with elements of . Let be a permutation with c and d as four entries in (that follow in this order from left to right, but are not necessarily consecutive). If , then is called form a -pattern. If there are no four entries in that form -pattern, then is called - avoiding. In this project, we review how to determine the number of permutations of length that avoid pattern of length four and a special permutation that does not contain one of the pattern of length four which is called permutation two-stack sortable. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| topic |
Matematika |
| spellingShingle |
Matematika Tarakolo, Seplin PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| description |
Permutation is called to contain a pattern , if has at least a subsequence
whose elements correspond with elements of . Let be a permutation with
c and d as four entries in (that follow in this order from left to right, but are not
necessarily consecutive). If , then is called form a -pattern.
If there are no four entries in that form -pattern, then is called -
avoiding. In this project, we review how to determine the number of permutations
of length that avoid pattern of length four and a special permutation that does
not contain one of the pattern of length four which is called permutation two-stack
sortable. |
| format |
Theses |
| author |
Tarakolo, Seplin |
| author_facet |
Tarakolo, Seplin |
| author_sort |
Tarakolo, Seplin |
| title |
PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| title_short |
PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| title_full |
PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| title_fullStr |
PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| title_full_unstemmed |
PERMUTATIONS OF LENGTH N THAT AVOID PATTERN OF LENGTH FOUR |
| title_sort |
permutations of length n that avoid pattern of length four |
| url |
https://digilib.itb.ac.id/gdl/view/33557 |
| _version_ |
1823637375171952640 |