On the Möbius function of a pointed graded lattice (Q1799423): Difference between revisions

Let \(I_n^\bullet\) denote the set of all pointed integer partitions of a non-negative integer \(n\). Here, a pointed integer partition of \(n\) is a pair \(\{u,\underline{m}\}\) where \(m\) is a non-negative integer \(\leq n\) and \(u=\{u_1,u_2,\ldots,u_r\}\) is an integer partition of \(n-m\). This pair \(\{u,\underline{m}\}\) can also be written as \(u_1u_2\ldots u_r\underline{m}\). For example, \[ I_3^\bullet=\{111\underline{0},\;12\underline{0},\;11\underline{1},\;2\underline{1},\;1\underline{2},\;3\underline{0},\;\underline{3}\}. \] The authors define an order relation ``\(\leq\)'' between two pointed integer partitions of \(n\). Then \((I_n^\bullet,\leq)\) forms a poset. This poset has unique minimal and maximal elements \(\hat{0}\) and \(\hat{1}\). In the above example, we have \[ \hat{0}=111\underline{0}\qquad \text{and}\qquad \hat{1}=\underline{3}. \] The main result of the paper under review is a closed form of the value of the Möbius function associated with \((I_n^\bullet,\leq)\). Namely, \[ \mu(I_n^\bullet):=\mu(\hat{1})=(-1)^n. \]