The zeta polynomial of P is the polynomial z such that for every i > 1, z(i) is the number of weakly increasing chains of i-1 vertices in P.
i1 : B = booleanLattice 3; |
i2 : z = zetaPolynomial B 3 o2 = q o2 : QQ[q] |
i3 : #B.GroundSet == sub(z, (ring z)_0 => 2) o3 = true |
i4 : #allRelations B == sub(z, (ring z)_0 => 3) o4 = true |