HIGHLIGHTS
- who: On Permutations Avoiding Partially et al. from the Department of Mathematics and Statistics University of Strathclyde Glasgow, United Kingdom have published the article: On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs, in the Journal: (JOURNAL)
- how: Throughout this paper the notation a(n) is used for the number of n-permutations avoiding the pattern p in question that is a(n)=|Sn (p)|. The following two theorems were obtained.
SUMMARY
The permutation 364125 has two occurrences of the pattern 123, namely, the subsequences 345 and 125, while this . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.