科研之友
微信
新浪微博
Facebook
分享链接
摘要
An occurrence of a consecutive permutation pattern p in a permutation pi is a segment of consecutive letters of pi whose values appear in the same order of size as the letters in p. The set of all permutations forms a poset with respect to such pattern containment. We compute the Mobius function of intervals in this poset. For most intervals our results give an immediate answer to the question. In the remaining cases, we give a polynomial time algorithm to compute the Mobius function. In particular, we show that the Mobius function only takes the values -1, 0 and 1.
- 出版日期2011-7-15
