Biography

Time: July 9^th-13^th, 2018

Aim:

Introducing frontier research problems at a level of research that are potentially solvable. 

Participants:

Turing Class Students and Graduate students, one each brought over by Lecturers, plus 20 students upon registration.

Schedule:

Morning: Presentation 10am - 12:30 pm

Afternoon: Discussion

Activities:

Each speaker spent a couple of hours introducing a couple of problems at an appropriate level, together with a couple of papers for further study. 

Students move interested in the problem form a study group with the speaker for further research studies, discussing the problems and possibly work on it. But the end of the week some students may form a small (wechat) research group for future interactions. 

Invited Talks:

Professor Xiaotie Deng: PPA complete problems

Professor Minming Li: Facility Location Games

Professor Tian Liu: Tree convex bipartite graphs

Professor Pinyan Lu: Roots of polynomial and approximate counting

Professor Hanpin Wang: Eulerian Orientation and Six-vertex model

Professor Zihe Wang: Delegated search and prophet inequality

Professor Mengji Xia: Tensor networks and counting problems