报告人：Prof. Shuhong Gao
Polynomial systems are ubiquitous in Mathematics, Sciences and Engineerings, and Gröbner basis theory is one of the most powerful tools for solving polynomial systems from practice. Buchberger introduced in 1965 the first algorithm for computing Gröbner bases and it has been implemented in most computer algebra systems (e.g. Maple, Mathematica, Magma, etc). Faugere presented two new algorithms: F4 (1999) and F5 (2002), the latter being the fastest algorithm known in the last decade. In this talk, I shall present an overview on recent progress on efficient algorithms for computing Gröbner, including the GVW algorithm which is a joint work with Professor Mingsheng Wang.
Shuhong Gao received his BS (1983) and MS (1986) from Department of Mathematics, Sichuan University, China, and PhD degree (1993) from Department of Combinatorics and Optimization, University of Waterloo, Canada. From 1993 to 1995, he was an NSERC Postdoctoral Fellow in Department of Computer Science, University of Toronto, Canada. He joined Clemson University, USA, in 1995 as an assistant professor in Mathematical Sciences, and was promoted to associate professor in 2000 and to full professor in 2002. Professor Gao has published over 60 papers in the areas of combinatorial design theory, finite fields, coding theory, cryptography,
symbolic computation, and computational algebraic geometry. His research has been
supported by grants from NSA, NSF and ONR. More information about his research and teaching can be found at http://www.math.clemson.edu/~sgao.