We prove that the number of symmetric chain decompositions of the Boolean lattice 2[n]2[n] is (n2e+o(n))2n.(2en+o(n))2n. Furthermore, the number of symmetric chain decompositions of the hypergrid [t]n[t]n is n(1−on(1))⋅tn.n(1−on(1))⋅tn.
生成讲解博客的中文版本
生成AI智能校验的中文版本