A Generalization of RSK to d-Complete Posets
The Electronic Journal of Combinatorics · 09.10.2026 · 33 (4)
DOI: 10.37236/15257 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 09.10.2026. Verfasst von Son Nguyen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
The hook length formula for d-complete posets expresses the number of linear extensions of a d-complete poset $P$ in terms of hooks of $P$. 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 the first purely combinatorial proof of the hook length formula for d-complete posets. Our approach is to define a generalization of the Robinson-Schensted-Knuth bijection for d-complete posets, which may be of independent interest.
Zitieren
APA
Nguyen, S., Vulakh, J., & Woodruff, D. (2026). A Generalization of RSK to d-Complete Posets. The Electronic Journal of Combinatorics, 33(4). https://doi.org/10.37236/15257
Vancouver
Nguyen S, Vulakh J, Woodruff D. A Generalization of RSK to d-Complete Posets. The Electronic Journal of Combinatorics. 2026;33(4). doi:10.37236/15257
BibTeX
@article{Nguyen2026,
author = {Nguyen, Son and Vulakh, Joseph and Woodruff, Dora},
title = {A Generalization of RSK to d-Complete Posets},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {4},
doi = {10.37236/15257}
}
EUVIMED