CA seminar in 17 April

[Alexander Kryukov]

Wednesday, April, 17, 17:00 (room 3-24, building KFVE, Institute of 
Nuclear Physics, Moscow State University).

---------------------
Computing Polynomial Janet Bases
V.P.Gerdt*, D.A.Yanovich*, Yu.A.Blinkov**
( * Laboratory of Information Technologies Joint Institute for Nuclear 
Research 141980 Dubna, Russia
** Department of Mathematics and Mechanics Saratov State University 410071 
Saratov, Russia )

In this talk we present the current status of our C/C++ software for 
computing polynomial Janet bases which are typical representatives of 
involutive bases and usually redundant as Groebner ones. We compare 
efficiency of our codes with those in computer algebra systems Singular 
and Magma providing fast implementation of the Buchberger algorithm for 
computing reduced Gr\"{o}bner bases. As benchmarks we use the collection 
of polynomial systems widely exploited for testing Gr\"{o}bner bases 
software. Applicability of Janet bases to computing toric ideals will be 
also discussed.

------------------
The Poles of Solutions of Difference Equations.
Sergei A. Abramov
( Russian Academy of Sciences, Dorodnicyn Computing Centre )

We present an approach to sharpen the bounds for the set of poles of the 
meromorphic solutions of difference equations with polynomial 
coefficients. The desingularization of the operator corresponding to the 
given equation plays the key role.

Additionally we consider certain problems related to the existence of 
solutions that are analytic (r times continuously differentiable, 
continuous) everywhere on R. The results were obtained jointly with M. van 
Hoeij.

------------------------
Complete information about seminar you can get from the Web site:

           http://theory.sinp.msu.ru/CA

-- 
===============================================================
Alexander Kryukov         Skobeltsyn Institute of Nuclear Physics
                          Moscow State University
Off. +7 095 939 2875      119992, Moscow
Fax  +7 095 939 0397      RUSSIA
===============================================================