TOPICS
Search

q-Zeta Polynomial


The q-zeta polynomial Z_(P,h)(x) of a nonempty finite partially ordered set P with a height function h is the polynomial in x over Q(q) characterized by

 Z_(P,h)([n]_q)=sum_(e_1<=...<=e_(n-1))q^(h(e_1)+...+h(e_(n-1))),

where n>=2, [n]_q=(q^n-1)/(q-1) is the q-bracket, and the sum is over weakly increasing sequences in P. The height function takes nonnegative integer values and satisfies h(a)<h(b) whenever a<b in P (Chapoton 2026, pp. 3-5).

The polynomial degree of Z_(P,h)(x) over Q(q) is max_(a in P)h(a). Its specialization at q=1 is the classical zeta polynomial Z_P(x), so it is a q-analog of that invariant. The polynomial degree can drop under this specialization. Although each value at [n]_q for n>=2 has nonnegative integer coefficients as a polynomial in q, this does not imply nonnegative coefficients in every expansion of Z_(P,h)(x) (Chapoton 2026, pp. 5-6).

For a three-element chain whose successive heights are 0, 1, and 2, the defining sum gives

 Z_(P,h)(x)=(x(1+qx))/(1+q).

At q=1 this becomes x(x+1)/2, the zeta polynomial of the three-element chain.


See also

Partially Ordered Set, q-Analog, Zeta Polynomial

Explore with Wolfram|Alpha

References

Chapoton, F. "On a q-Analogue of the Zeta Polynomial of Posets." Elec. J. Combin. 33, P4.21, 2026. https://doi.org/10.37236/13820.Stanley, R. P. Enumerative Combinatorics, Vol. 1, 2nd ed. Cambridge, England: Cambridge University Press, pp. 291-292, 2012. https://doi.org/10.1017/CBO9781139058520.

Cite this as:

Weisstein, Eric W. "q-Zeta Polynomial." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/q-ZetaPolynomial.html

Subject classifications