The Möbius function of the consecutive pattern poset
The electronic journal of combinatorics, Tome 18 (2011) no. 1
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$.
DOI :
10.37236/633
Classification :
05A05, 06A07
Mots-clés : consecutive permutation pattern, polynomial time algorithm
Mots-clés : consecutive permutation pattern, polynomial time algorithm
@article{10_37236_633,
author = {Antonio Bernini and Luca Ferrari and Einar Steingr{\'\i}msson},
title = {The {M\"obius} function of the consecutive pattern poset},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/633},
zbl = {1227.05007},
url = {http://geodesic.mathdoc.fr/articles/10.37236/633/}
}
Antonio Bernini; Luca Ferrari; Einar Steingrímsson. The Möbius function of the consecutive pattern poset. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/633
Cité par Sources :