A symmetric chain decomposition of L(6,n)
Combinatorics
2026-04-28 v1
Abstract
We give a constructive proof that Young's lattice L(6,n) has a partition into saturated symmetric chains.
Cite
@article{arxiv.2604.23042,
title = {A symmetric chain decomposition of L(6,n)},
author = {Xiangdong Wen},
journal= {arXiv preprint arXiv:2604.23042},
year = {2026}
}