Workneh, Daniel (2012) On Pattern Avoiding Permutations. Masters thesis, Addis Ababa University.
![[img]](http://thesisbank.jhia.ac.ke/style/images/fileicons/application_pdf.png) |
PDF (On Pattern Avoiding Permutations)
Daniel, Workneh.pdf - Accepted Version Restricted to Repository staff only Download (380kB) | Request a copy |
Abstract
Finding the Number of n-permutations avoiding a pattern q and also finding the Stanley-Wilf limit of this pattern are some of the most difficult questions in the theory of pattern avoidance. Very few affirmative answers are known regarding these problems. One of the most prominent ones is the Simon-Schimidt bijection from which we can find the Stanley-Wilf limit of patterns of length three. The aim of this work is to generalize an upper bound for the Stanley-Wilf limit of an infinite sequence of patterns using a result of particular kind. We start by introducing major results in pattern avoidance and studying their behaviour deeply. In particular, patterns of length three and four. Generalizations for an upper bound of the Stanley-Wilf limit of the pattern 1324 to an infinite sequences of patterns are the main results of this work and one of them is an improvement of the previous result of Mikl´os B´ona.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Africana |
| Depositing User: | Selom Ghislain |
| Date Deposited: | 25 Sep 2018 12:07 |
| Last Modified: | 25 Sep 2018 12:07 |
| URI: | http://thesisbank.jhia.ac.ke/id/eprint/5717 |
Actions (login required)
 |
View Item |