报告时间：2021年12月15日（星期三）19:00-20:30

报告地点：腾讯会议：328-934-802

报 告 人：Pedro Patricio 教授

工作单位：University of Minho

举办单位：金沙集团1862cc成色

报告人简介：Prof. Pedro Patricio received his PhD degree in Mathematics from University of Minho, Portugal in 2002. He is currently a Professor in Department of Mathematics, University of Minho. He served as Director of CMAT, University of Minho. His research interests include generalized inverses and partial orders.  He has published more than 50 peer reviewed papers in leading journals including Linear Algebra Appl., Linear Multilinear Algebra, Electron. J. Linear Algebra, and J. Aust. Math. Soc. etc.

报告简介：Euclid's Algorithm is, without question, one of the most important ``super algorithms" in mathematics. It is fast and can be executed efficiently via recurrence relations. In this talk we shall extend this algorithm to  binomials, geometric sums  and corner sums. ``Telescoping sums" appear in many branches of mathematics, from block matrices to convergence  and from iteration to polynomial division. Such sums appear naturally when considering the Drazin inverse of triangular block matrices.