地点：行健楼503
邀请人：周海燕教授
摘要： The Shortest Vector Problem and the computation of tame kernel in algebraic K-theory are two different but very important problems, and up to now no one has found any manipulated relations between them. We are successful in the first time to reduce the computation of tame kernel, in particular the computation of elements of the set $C_{m},$ the key part in the method proposed by Tate, to the Shortest Vector Problem of some lattice. Then, with the help of PARI library we implement the above idea and develop a program for computing the tame kernels of the cyclotomic fields with class number 1.