Zeros of the M\"{o}bius function of permutations
Robert Brignall, V\'it Jel\'inek, Jan Kyn\v{c}l, David Marchant

TL;DR
This paper investigates conditions under which the M"obius function of permutation intervals is zero, providing asymptotic bounds and identifying structural patterns that lead to a zero value.
Contribution
It introduces new structural criteria for permutations that guarantee a zero M"obius function, including asymptotic bounds and specific interval configurations.
Findings
Proves permutations with certain interval patterns have zero M"obius function.
Establishes a lower bound of (1-1/e)^2 for permutations with zero M"obius function.
Identifies structural conditions involving direct sums and specific interval types leading to zero M"obius function.
Abstract
We show that if a permutation contains two intervals of length 2, where one interval is an ascent and the other a descent, then the M\"{o}bius function of the interval is zero. As a consequence, we show that the proportion of permutations of length with principal M\"{o}bius function equal to zero is asymptotically bounded below by . This is the first result determining the value of for an asymptotically positive proportion of permutations . We also show that if a permutation can be expressed as a direct sum of the form , then any permutation containing an interval order-isomorphic to has ; we deduce this from a more general result showing that whenever contains an interval of a certain form. Finally, we show that if a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Bayesian Methods and Mixture Models
