The Möbius function of the consecutive pattern poset (Q554000)

Summary: 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 Möbius 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 Möbius function. In particular, we show that the Möbius function only takes the values \(- 1, 0\) and 1.