  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.
