from    
to    
search  

 


The Dark Side of STING in The Neuropathology of NiemannPick DiseaseType
Unconventional Conjugation in Silsesquioxanes
Characterization of computational power in measurement-based quantumcomputati...
生成式人工智能的技术演进与行业应用
报告题目:
Hook length formulas : Combinatorics and Number Theory
 报告人:
HAN Guo-Niu
Prof.    法国国家科研中心研究员
报告时间:
2008-11-13 14:30
报告地点:
理科楼1304报告厅
主办单位:
数学科学系
  简介:

1. Combinatorics

     We introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions. In particular, we derive an expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov. We also obtain an extension by adding two more parameters, which appears to be a discrete interpolation between the Macdonald identities and the generating function for t-cores.

 2. Number Theory

    Our formula unifies the classical Jacobi and Gauss identities when t=2. We proved some arithmetical properties for t=3 and made a general conjecture. In the case t=5, the conjecture implies the long standing Lehmer conjecture which says that the Ramanujan tau-function never takes the zero value.

今日相关信息
SYSTEMICS
 
同类别相关信息
Traveling Waves of Integral Differe...
Symmetries and the Riemann Hypothesis
数学的人文内涵与技术外延
Mach Reflection of Solitary Waves i...
Multitransition solutions of a fami...
学术活动