Thotsaporn Thanatipanonda
Mahidol University International College

16:00 Wednesday, 31 May 2017, Room 3306, MUIC

A combinatorial identity usually stands as an interesting problem on its own. However, quite frequently, some counting problem has a structure which connects to some other fields of mathematics. In this talk, I will mention the counting of “tableau” and its connection to the character function, from a representation theory, through symmetric functions. With these structures, a lot more beautiful identities can be generated and proved.

• I.G. Macdonald, “Symmectric Functions and Hall Polynomials”,2nd ed., Clarendon Press, Oxford, 1995
• A. Regev, A. Regev, D. Zeilberger, “Identities in Character Tables of S_n”, Journal of Difference Equations and Applications 22, 2016, 272-279
  
• B. Sagan, “The Symmetric Group”, 2nd ed., Springer, 2000

• Slides