The Möbius function of separable and decomposable permutations

  • Authors:

  • Alexander Burstein;Vít Jelínek;Eva Jelínková;Einar Steingrímsson

  • Affiliations:

  • Department of Mathematics, Howard University, Washington, DC 20059, USA;Fakultät für Mathematik, Universität Wien, Garnisongasse 3, 1090 Wien, Austria;Department of Applied Mathematics, Charles University in Prague, Malostranské nám. 25, 110 00 Prague, Czech Republic;Department of Computer and Information Sciences, University of Strathclyde, Glasgow G1 1XH, UK

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give a recursive formula for the Mobius function of an interval [@s,@p] in the poset of permutations ordered by pattern containment in the case where @p is a decomposable permutation, that is, consists of two blocks where the first one contains all the letters 1,2,...,k for some k. This leads to many special cases of more explicit formulas. It also gives rise to a computationally efficient formula for the Mobius function in the case where @s and @p are separable permutations. A permutation is separable if it can be generated from the permutation 1 by successive sums and skew sums or, equivalently, if it avoids the patterns 2413 and 3142. We also show that the Mobius function in the poset of separable permutations admits a combinatorial interpretation in terms of normal embeddings among permutations. A consequence of this interpretation is that the Mobius function of an interval [@s,@p] of separable permutations is bounded by the number of occurrences of @s as a pattern in @p. Another consequence is that for any separable permutation @p the Mobius function of (1,@p) is either 0, 1 or -1.