Dyck paths and a bijection for multisets of hook numbers
Combinatorics
2011-10-19 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0102223,
title = {Dyck paths and a bijection for multisets of hook numbers},
author = {Ian Goulden and Alexander Yong},
journal= {arXiv preprint arXiv:math/0102223},
year = {2011}
}
Comments
10 pages, 4 figures