Counting hypergraph colorings in the local lemma regime

Heng Guo, Chao Liao, Pinyan Lu +1

We give a fully polynomial-time approximation scheme (FPTAS) to count the number of $q$-colorings for $k$-uniform hypergraphs with maximum degree $\Delta$ if $k\ge 28$ and $q >357Δ^{\fr…