Dyck paths and a bijection for multisets of hook numbers [article]

Ian Goulden, Alexander Yong
2001 arXiv   pre-print
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture, by means of a construction involving Dyck paths, a particular type of lattice path.
arXiv:math/0102223v1 fatcat:27scfub4xzbofjffxf72pobfbm