The present paper proposes a new approach. We convert the weighted vectors of length used by Macdonald in his identity for type to weighted partitions with free parameter , so that a new identity on the latter combinatorial structures can be derived without any restrictions on . The surprise is that the weighted partitions have a very simple form in terms of hook lengths of partitions. As applications of our formula, we find some new identities about hook lengths, including the “marked hook formula”. We also improve a result due to Kostant. The proof of the Main Theorem is based on Macdonald’s identity for and on the properties of a bijection between -cores and integer vectors constructed by Garvan, Kim and Stanton.

生成讲解博客的中文版本

生成AI智能校验的中文版本