Date：August 21st, 16:00-17:00

Location：Lecture hall

Abstract：

A central theme in algebra and number theory is to count the roots of a polynomial system over a field. In this introductory lecture, we explore the algorithmic aspect of root counting, mostly when the base field is a finite field. Connections with other branches of mathematics will be mentioned along the away, ending with a recent algorithmic application to computer science.

Introduction of Speaker：

Daqing Wan is a Professor at University of California, Irvine. His primary interests include number theory and arithmetic algebraic geometry, particularly zeta functions over finite fields. He is known for his proof of  Dwork's conjecture. He received the Morningside Silver Medal of Mathematics in 2001. Many of his works have been published in top math journals  Annals of Mathematics, Journal of the American Mathematical Society and so on. Wan's contributions also extend to computational number theory, coding, and computational complexity, many works have been published in computer science and information theory journals such as FOCS, STOC, FOCM, and IEEE IT.

Welcome！