The International Conference Polynomial Computer Algebra
April 4-7, Saint-Petersburg, Russia
Euler International Mathematical Institute
April 4
10.00—11.00 Registration, coffee
11.00—11.15 Opening ceremony
11.20—12.10 Boolean Groebner Bases and Involutive Divisions
12.15—13.00 Kornyak V. Discrete Dynamical Systems and
Their Symmetries
13.00—15.00 Lunch
15.00—15.45 Blinkov Yu. A. Specialized Computer Algebra
System GINV
15.50—16.30 Yanovich D. A. Parallel Computation of Gröbner and Involutive
Bases
16.30—16.50 Coffee break
16.50—Parallel polynomial recursive algorithms
— Computation of characteristic
polynomial of integer matrices.
18.30 WELCOME
PARTY
April 5
10.00—10.50 Chistov A. A Survey of Algorithms Related to
the Problem of Solving Systems of Polynomials Equations with the Complexity
Polynomial in $d^n$"
10.50—11.30 Soloviev S. Proof Theory and the Study of Diagrams in Closed
Categories
11.30—11.50 Coffee break
11.50—12.30 Proskurin N. About computation of zeros of
L-functions
12.30—13.00 Faizullin R. Functionals associated with Hamiltonian Circuit
problem
13.00—15.00 Lunch
15.00—15.45
Differential Standard Bases with respect to
Reverse Lexicograpical Orderings
15.45—16.30 Vassiliev N. Monomial Combinatorics of Polynomial Ideals.
16.30—17.00 Coffee break
17.00—17.30 Betin A. About calculating of complex roots of
polynomials.
17.30—18.00 Efimovskaya O.V. Integrable ordinary differential equations on
associative algebras
April 6
10.00—10.50 Chistov A, Double-Exponential Lower Bound for
the Degree of any System of Generators of a Polynomial Prime Ideal
10.50—11.10 Coffee break
11.10—12.00 Akritas A., Quadratic Complexity Bounds on the Values of Positive
Roots of Polynomials
12.10—12.50 Vassiliev N, and Pavlov D., Enumeration of finite monomial
orderings and Young tableaux
12.50—14.10 Lunch
Excursion to the Pushkin Palace and
Amber room
The bus will start from the Euler
Institute at 14:15
19.00 BANQUET
April 7
10.00—10.40 Estimation of accuracy of
polynomial roots in the algorithm for
symbolic solving of differential equations
10.40—11.10 Comparison of polynomial
multiplication algorithms
11.10—11.30 Coffee break
11.30—12.10 Mylläri A. and Gogin N. A Recurrent
Algorithm for Conway Matrices Related to a Non-transitive Head-or-Tail
Game12.10—13.00
12.10—12.40. Radon transformation on finite plane
12.40—13.10Kazakov A.Ya., Slavyanov
S.Yu., Integral Euler
transform for isomonodronically deformed Heun equation
13.10—15.00 Lunch
15.00—16.00 Round table discussion. Open problems of modern Polynomial
Computer Algebra.
Closing of the Conference