The Möbius function of the permutation pattern poset

From MaRDI portal




Abstract: A permutation au contains another permutation sigma as a pattern if au has a subsequence whose elements are in the same order with respect to size as the elements in sigma. This defines a partial order on the set of all permutations, and gives a graded poset P. We give a large class of pairs of permutations whose intervals in P have Mobius function 0. Also, we give a solution to the problem when sigma occurs precisely once in au, and sigma and au satisfy certain further conditions, in which case the Mobius function is shown to be either -1, 0 or 1. We conjecture that for intervals [sigma, au] consisting of permutations avoiding the pattern 132, the magnitude of the Mobius function is bounded by the number of occurrences of sigma in au. We also conjecture that the Mobius function of the interval [1, au] is -1, 0 or 1.









This page was built for publication: The Möbius function of the permutation pattern poset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989228)