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.
Recommendations
- On the Möbius function of permutations with one descent
- The Möbius function of separable and decomposable permutations
- The Möbius function of the permutation pattern poset
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- Zeros of the Möbius function of permutations
Cites work
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- Intervals of permutations with a fixed number of descents are shellable
- On the Möbius function of permutations with one descent
- On the topology of the permutation pattern poset
- The Möbius function of a composition poset
- The Möbius function of separable and decomposable permutations
- The Möbius function of the permutation pattern poset
- The patterns of permutations
Cited in
(7)- On the Möbius function of permutations with one descent
- The Möbius function of separable and decomposable permutations
- Zeros of the Möbius function of permutations
- scientific article; zbMATH DE number 6806830 (Why is no real title available?)
- On the poset of non-attacking King permutations
- On the growth of the Möbius function of permutations
- 2413-balloon permutations and the growth of the Möbius function
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)