On some new hook-content identities
Combinatorics
2018-09-07 v1
Abstract
Based on the work of A. Vershik, we introduce two new combinatorial identities. We show how these identities can be used to prove a new hook-content identity. The main motivation for deriving this identity was a particular optimization problem in the field of quantum information processing.
Cite
@article{arxiv.1809.02008,
title = {On some new hook-content identities},
author = {Michal Sedlák and Alessandro Bisio},
journal= {arXiv preprint arXiv:1809.02008},
year = {2018}
}
Comments
10 pages, 1 figure