Combinatorics on integer partitions

发布时间:2017-06-01浏览次数:898

Speaker:Guoniu Han

Institution: Université de Strasbourg

Time: 2017.06.01, 16:00-17:00

Location: Room 503, Gewu Building

Title:Combinatorics on integer partitions

Abstract:

Integer partitions were first studied by Euler. In the first part of this talk, I shall introduce the hook length expansion technique and explain how to find old and new hook length formulas for integer partitions. In particular, we derive an expansion formula for the powers of the Euler Product in terms of hook lengths, which is discovered by Nekrasov-Okounkov and Westburg. Then, we prove that the Plancherel average of the even power sum of hook or content lengths is always a polynomial for certain classes of integer partitions, such as strict, doubled distinct and self-conjugate partitions. Finally, we mention the link with the limit shape conjecture for strict partition.


Copyright (C)2023 哈尔滨工业大学数学研究院版权所有
人才招聘:
联系我们:
电话:86413107      邮箱:IASM@hit.edu.cn
地址:哈尔滨市南岗区西大直街92号
技术支持:哈尔滨工业大学网络安全和信息化办公室