pith. sign in

arxiv: 0806.1500 · v3 · pith:RFC25VCUnew · submitted 2008-06-09 · 🧮 math.CO

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

classification 🧮 math.CO
keywords biusposetrnerfunctioncasechoosecompositionprove
0
0 comments X
read the original 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 $C_{d+1}$ is isomorphic to the poset of words $A_d^*$. This allows us to use techniques developed by Bj\"{o}rner to study the M\"{o}bius function of $C_{d+1}$. We use counting arguments and shellability as avenues for proving that the M\"{o}bius function is $\mu(u,w)=(-1)^{|u|+|w|}{w\choose u}_{dn}$, where ${w\choose u}_{dn}$ is the number of $d$-normal embeddings of $u$ in $w$. 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.