We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
生成讲解博客的中文版本
生成AI智能校验的中文版本