Generalized (\(P\), \(\omega\))-partitions and generating functions for trees (Q1399914)

For finite posets \(P\) and labelings \(\omega\), \((P,\omega)\)-partitions are maps \(\phi:P\to \mathbb{N}= \{0,1,2,\dots\}\) which are order-reversing and such that \(\phi(x)- \phi(y)\geq 1\) if \(x< y\), \(\omega(x)> \omega(y)\). If \(h: P\to P\) satisfies \(\sum q^{|\phi|}= \prod_{x\in P}(1/1- q^{h(x)})\), \(|\phi|= \sum_{x\in P}\phi(x)\), then \(P\) has hook lengths and is a hook length poset. Gaussian posets are hook length posets with \(\sum q^{|\phi|}= \prod_{x\in P}(1- q^{h(x)}+ n)/(1- q^{h(x)})\), for any \(n\in\mathbb{N}\), and the left-hand side is over all with \(\phi(x)\leq n\). Many other posets are hook length posets including \(d\)-complete posets which include shapes and trees. Trees are not always Gaussian posets. The goal of this paper is to generalize the notion of \((P,\omega)\)-partitions and then obtain a formula (and thus a combinatorial structure) for trees analogous to the one for Gaussian posets. Edge-labelings \(R\) are defined on the set of covering edges, i.e., those in the Hasse diagram of \(P\) to the intgers \(\mathbb{Z}\), with \((P,R)\)-partitions \(\phi: P\to\mathbb{N}\) having \(\phi(x)- \phi(y)\geq R(x,y)\) (\(x\) covered by \(y\)). If \(A(P,R,n)\) is the set of \((P,R)\)-partitions with \(\phi(x)\leq n\), and \(U_n(P,R;q)= \sum q^{|\phi|}\), \(\phi\in A(P,R,n)\), then for \(T\) a tree and \(RX(P)\), \(RN(P)\) edge labelings satisfying special (but natural) conditions, \(R\in RX(T)\cap RN(T)\) satisfying another special condition (T), yields just the right control as well as sufficient generality to make the result (Theorem 1.1) both provable and interesting, with condition (T) for \(R\in RX(T)\cap RN(T)\) conjectured to be a hook edge labeling of \(T\) precisely.