Computer Algebra Seminar No.33 (計算代数セミナー, 第33回) at Kobe University
(神戸大学)
March 23 (Mon), 2009. 3月23日 (月曜日), 13:20---14:20, 14:50--15:50
場所：神戸大学 理学部B棟 B314
-
13:20--14:20: Franz Winkler (RISC, Johannes Kepler University, Linz),
Canonical Reduction Systems in Symbolic Mathematics
Many algorithmic methods in mathematics can be seen
as constructing canonical systems for deciding membership problems.
Important examples are Gauss' elimination method for linear systems,
Euclid's algorithm for computing greatest common divisors,
Buchberger's algorithm for constructing Groebner bases, or
the Knuth-Bendix procedure for equational theories.
We explain the basic concept of canonical systems and investigate
the close connections between these algorithms.
-
14:50--15:50: Eugene Zima (Wilfrid Laurier University),
Closed form summation from integral representation point of view
abstract
Past Lectures.
---------------------------------------------------------------
The computer algebra seminar is co-organized by
M.Noro, noro @ math.kobe-u.ac.ｊｐ
N.Takayama, takayama @ math.kobe-u.ac.ｊｐ
K.Yokoyama, yokoyama @ rkmath.rikkyo.ac.ｊｐ
For more info see http://www.math.kobe-u.ac.jp/seminar.html/compalg.html
http://www.math.kobe-u.ac.jp/seminars.html