报告题目：The hook length on integer partitions

报 告 人：臧经涛 教授（西北工业大学）

报告时间：2026年10月14日（星期三）14:30—15:30

报告地点：线上报告，腾讯会议：244-131-460

校内联系人：毛建玺 副教授         联系方式：84708351-8604

报告摘要：Hook lengths are an important research subject in integer partitions and are closely related to many branches of mathematics, such as representation theory, modular forms, and symmetric functions. The problem of counting hooks on specific partitions was first considered by Andrews and Beck, who gave inequalities for the number of 1-hooks on 2-regular partitions and 2-distinct partitions. Subsequently, scholars have provided several inequalities for the number of hooks on regular partitions and distinct partitions. In this talk, we resolve several conjectures proposed by Singh and Barman concerning the number of hooks on regular partitions. Furthermore, inspired by the work of Huang and Wang, we study the number of hooks on t-core partitions and on (s,t)-core partitions, and give several inequalities. This is joint work with Hongshu Lin, Wenxia Qu and Huan Xiong.

报告人简介：臧经涛，西北工业大学教授，博士生导师。主要从事整数分拆方向的研究，在《Adv. Math.》《J. Reine. Angew. Math.》《Sci. China. Math.》《J. Number Theory》《European J. Combin.》《Adv. Appl. Math.》 等期刊发表论文十余篇。解决了包括美国数学会前会长 G.E. Andrews 等人提出的多个公开问题。主持国家自然科学基金两项，并入围2025 年国家自然科学基金青年基金 B 类答辩。