The Möbius function of permutations with an indecomposable lower bound

From MaRDI portal




Abstract: We show that the M"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this can simplify the calculation of the M"obius sum. For increasing oscillations, we give a recursion for the M"obius sum which only involves evaluating simple inequalities.









This page was built for publication: The Möbius function of permutations with an indecomposable lower bound

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