A polylogarithmic bound for list replicability

Ari Blondal, Hamed Hatami, Pooya Hatami +2

Zhang [Zha26] recently posted a manuscript announcing that the list-replicability number of every class of $M\ge 2$ binary concepts on $N\ge 2$ domain points is $O({\log }^{2}M\log N)$…