The M\"{o}bius Function of a Restricted Composition Poset
Adam M. Goyt

TL;DR
This paper investigates the Möbius function of a restricted composition poset, establishing its isomorphism to a word poset and deriving explicit formulas and rationality results using combinatorial and automata techniques.
Contribution
It introduces a new isomorphism between a composition poset and a word poset, enabling explicit Möbius function formulas and proving rationality of associated generating functions.
Findings
Möbius function formula: (u,w)=(-1)^{|u|+|w|}{wu}_{dn}
Both zeta and Möbius functions have rational generating series
The composition poset is isomorphic to the word poset A_d^*
Abstract
We study a poset of compositions restricted by part size under a partial ordering introduced by Bj\"{o}rner and Stanley. We show that our composition poset is isomorphic to the poset of words . This allows us to use techniques developed by Bj\"{o}rner to study the M\"{o}bius function of . We use counting arguments and shellability as avenues for proving that the M\"{o}bius function is , where is the number of -normal embeddings of in . We then prove that the formal power series whose coefficients are given by the zeta and the M\"{o}bius functions are both rational. Following in the footsteps of Bj\"{o}rner and Reutenauer and Bj\"{o}rner and Sagan, we rely on definitions to prove rationality in one case, and in another case we use finite-state automata.
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 · semigroups and automata theory · Advanced Mathematical Identities
