제목: An IMO problem, Coxeter groups and fusion rings
연사: 이철희 (KIAS)
일시: 2018년 4월 19일 목요일 13-14pm, 14:30-15:30pm.

초록: Problem 3 of the International Mathematical Olympiad in 1986 is as follows: To each vertex of a regular pentagon an integer is assigned in such a way that the sum of all five numbers is positive. If three consecutive vertices are assigned the numbers x, y, z respectively and y<0 then the following operation is allowed: the numbers x, y, z are replaced by x+y, -y, z+y respectively. Such an operation is performed repeatedly as long as at least one of the five numbers is negative. Determine whether this procedure necessarily comes to an end after a finite number of steps.
I will explain this algorithm using the Coxeter groups and how to use it for computations with the affine fusion rings that arise from conformal field theory

* 수학과 대수학 세미나입니다. 최도훈 교수님께서 주관하십니다.
https://sites.google.com/site/kualgebra/