過去の記録 ~02/25次回の予定今後の予定 02/26~

開催情報 火曜日 16:30~18:00 数理科学研究科棟(駒場) 126号室
担当者 小林俊行


15:00-16:30   数理科学研究科棟(駒場) 126号室
Christian Ikenmeyer 氏 (Max-Planck-Institut fur Informatik)
Plethysms and Kronecker coefficients in geometric complexity theory
[ 講演概要 ]
Research on Kronecker coefficients and plethysms gained significant momentum when the topics were connected with geometric complexity theory, an approach towards computational complexity lower bounds via algebraic geometry and representation theory. This talk is about several recent results that were obtained with geometric complexity theory as motivation, namely the NP-hardness of deciding the positivity of Kronecker coefficients and an inequality between rectangular Kronecker coefficients and plethysm coefficients. While the proof of the former statement is mainly combinatorial, the proof of the latter statement interestingly uses insights from algebraic complexity theory. As far as we know algebraic complexity theory has never been used before to prove an inequality between representation theoretic multiplicities.