Speaker: Ting-Wei Chao, an instructor in Applied Mathematics at Massachusetts Institute of Technology. He got his Ph.D. from the ACO program at Carnegie Mellon University, working with Boris Bukh. He won a golden medal at the 2014 International Mathematical Olympiad (IMO). His research interests lie in Combinatorics, including the polynomial method, extremal combinatorics, discrete geometry, enumerative combinatorics.

Date: March 27, 2025

Time: 8:30 am

Location: Zoom Meeting: 94821939967 (Password: 145291)

Sponsor: Data Science Institute, Shandong University

Abstract:

In this talk, we will start with a new proof of the classic Turán theorem. We then reformulate the proof using Shannon entropy and show some connections between entropy and quantities on graph such as Lagrangian and spectral radius. Using these ideas, we also show some new Turán results on hypergraph. This is a joint work with Hung-Hsun Hans Yu.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/200399.htm