报告方式：线上报告，ZOOM会议(ID: 61967385088)
邀请人：周海燕 教授
摘要: Polynomial systems are ubiquitous in Mathematics, Sciences and Engineerings, and Groebner basis theory is one of the most powerful tools for solving polynomial systems from practice. In this talk, I will first give a brief review for polynomial systems arising from cryptosystems (for both private and public keys), then present recent algorithms for computing Groebner bases, which are based on signatures and criterion that can detect useless J-pairs without reduction. Part of the talk is based on the paper: Shuhong Gao, Frank Volny IV and Mingsheng Wang, ``A new framework for computing Groebner bases'', Mathematics of Computation, 85 (2016), no. 297, 449--465.