Alexander duals of multipermutohedron ideals (Q2452157)

Let \(u=(u_1, u_2,\ldots,u_n)\in\mathbb{N}^n\) with \(0\leq u_1<u_2< \cdots< u_n\). The convex hull of all permutations of \(u\) is an \((n-1)\)-dimensional polytope in \(\mathbb{R}^n\) which is called a permutohedron \(P(\mathbf{u})\). The permutohedron ideal \(I(\mathbf{u})\) is a monomial ideal generated by all monomials \(X^{\sigma \mathbf{u}}\) where \(\sigma \mathbf{u}= (\sigma u_1,\ldots,\sigma u_n)\) is a permutation of \(\mathbf{u}\). If we consider \(\mathbf{u}=(u_1, u_2,\ldots,u_n)\in\mathbb{N}^n\) with \(0\leq u_1\leq u_2\leq \cdots\leq u_n\) and \(u_i=u_j\) for some \(i\neq j\), then also the polytope \(P(\mathbf{u})\) and the ideal \(I(\mathbf{u})\) are well-defined. In this case, we call \(P(\mathbf{u})\) a multipermutohedron and \(I(\mathbf{u})\) a multipermutohedron ideal. From now on, we assume that \(u_1\geq 1\). Then the quotient \(R'= R/I(\mathbf{u})^{[v]}\) is an Artinian \(k\)-algebra, where \(I(\mathbf{u})^{[v]}\) is the Alexander dual of \(I(\mathbf{u})\) with respect to \(v=(u_n + c-1, u_n + c-1,\ldots, u_n + c-1)\) for some integer \(c\geq 1\). A parking function of length \(n\) is a sequence \((a_1,\ldots,a_n)\) of positive integers such that if \(b_1\leq b_2\leq\cdots\leq b_n\) is the increasing rearrangement of \(a_1,\ldots,a_n\), then \(b_i\leq i\) for all \(i\). For \(\lambda = (\lambda_1,\lambda_2,\ldots,\lambda_n)\) with \(\lambda_1\geq \lambda_2\geq\cdots\geq\lambda_n\), a \(\lambda\)-parking function of length \(n\) is a sequence \((a_1,\ldots,a_n)\) of positive integers such that if \(b_1\leq b_2\leq\cdots\leq b_n\) is the increasing rearrangement of \(a_1,\ldots,a_n\), then \(b_i\leq \lambda_{n-i+1}\) for all \(i\). It is known that \(\dim_k(R')\) equals the number of \(\lambda\)-parking functions, where \(\lambda = (\lambda_1,\lambda_2,\ldots,\lambda_n)\) such that \(\lambda_i=u_n-u_i+c\). In the paper under review, the authors give a simple proof of the Steck determinant formula for counting \(\lambda\)-parking functions by using a free resolution of \(R'\) and its multigraded Hilbert series. They also obtain a combinatorial formula for all the multigraded Betti numbers of \(I(\mathbf{u})^{[v]}\), where \(v=(u_n + c-1, u_n + c-1,\ldots, u_n + c-1)\).