English

The number of symmetric chain decompositions

Combinatorics 2024-05-16 v1

Abstract

We prove that the number of symmetric chain decompositions of the Boolean lattice 2[n]2^{[n]} is (n2e+o(n))2n.\left(\frac{n}{2e}+o(n)\right)^{2^n}. Furthermore, the number of symmetric chain decompositions of the hypergrid [t]n[t]^n is n(1on(1))tn.n^{(1-o_n(1))\cdot t^n}.

Keywords

Cite

@article{arxiv.2405.09322,
  title  = {The number of symmetric chain decompositions},
  author = {István Tomon},
  journal= {arXiv preprint arXiv:2405.09322},
  year   = {2024}
}

Comments

7 pages