Comparing list-color functions of uniform hypergraphs with their chromatic polynomials

In [J. Combin. Theory Ser. B 161 (2023), 109–119], the authors showed that the list-color function $P_l(G,k)$ of any simple graph $G$ of size $m$ coincides with its chromatic polynomial $P(G,k)$ for all integers $k\ge m-1$. In this article, we extend this conclusion to any uniform hypergraph. Furthermore, we show that for any $r$-uniform hypergraph $\mathcal{H}=(V,E)$, where $r\ge 2$, $P(\mathcal{H},L)-P(\mathcal{H},k)\ge (k-\mathrm{\mid }E\mathrm{\mid }+1)k^{\mathrm{\mid }V\mathrm{\mid }-r-1}\sum _{e\in E}(k-\mid \bigcap _{v\in e}L(v)\mid )$ holds for all integers $k$ with $k\ge \mathrm{\mid }E\mathrm{\mid }-1\ge 4$ and all $k$-assignments $L$ of $\mathcal{H}$, where $P(\mathcal{H},L)$ is the number of $L$-colorings of $\mathcal{H}$.