The number of symmetric chain decompositions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909203975634944 |
|---|---|
| author | Tomon, István |
| author_facet | Tomon, István |
| contents | We prove that the number of symmetric chain decompositions of the Boolean lattice $2^{[n]}$ is $$\left(\frac{n}{2e}+o(n)\right)^{2^n}.$$
Furthermore, the number of symmetric chain decompositions of the hypergrid $[t]^n$ is
$$n^{(1-o_n(1))\cdot t^n}.$$ |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_09322 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The number of symmetric chain decompositions Tomon, István Combinatorics We prove that the number of symmetric chain decompositions of the Boolean lattice $2^{[n]}$ is $$\left(\frac{n}{2e}+o(n)\right)^{2^n}.$$ Furthermore, the number of symmetric chain decompositions of the hypergrid $[t]^n$ is $$n^{(1-o_n(1))\cdot t^n}.$$ |
| title | The number of symmetric chain decompositions |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2405.09322 |