A generalization of RSK to $d$-complete posets
Combinatorics
2025-08-22 v2
Abstract
The hook length formula for -complete posets expresses the number of linear extensions of a -complete poset in terms of hooks of . It generalizes the usual hook length formula for standard Young tableaux, as well as hook length formulas for shifted Young tableaux and trees. We give a new proof of the hook length formula for -complete posets which is elementary and purely combinatorial. Our approach is to define a generalization of the Robinson-Schensted-Knuth bijection for -complete posets, which may be of independent interest.
Keywords
Cite
@article{arxiv.2508.13988,
title = {A generalization of RSK to $d$-complete posets},
author = {Son Nguyen and Joseph Vulakh and Dora Woodruff},
journal= {arXiv preprint arXiv:2508.13988},
year = {2025}
}
Comments
24 pages