We define the quasi consecutive pattern poset by declaring \sigma \leq \tau whenever the permutation \tau contains an occurrence of the permutation \sigma in which all the entries are adjacent in \tau except at most the first and the second. We then investigate the Moebius function of the quasi consecutive pattern poset and we completely determine it for those intervals [\sigma ,\tau ] such that \sigma occurs precisely once in \tau.
On the Moebius function of the quasi-consecutive pattern poset / Antonio Bernini; Luca Ferrari. - STAMPA. - (2014), pp. 14-17. (Intervento presentato al convegno Permutation Patterns 2014 tenutosi a Johnson City, East Tennessee State , USA. nel 7-11 Luglio 2014).
On the Moebius function of the quasi-consecutive pattern poset
BERNINI, ANTONIO;FERRARI, LUCA
2014
Abstract
We define the quasi consecutive pattern poset by declaring \sigma \leq \tau whenever the permutation \tau contains an occurrence of the permutation \sigma in which all the entries are adjacent in \tau except at most the first and the second. We then investigate the Moebius function of the quasi consecutive pattern poset and we completely determine it for those intervals [\sigma ,\tau ] such that \sigma occurs precisely once in \tau.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
