Applied Parametric Symbolic Computation


        Dr. Thomas Sturm <>
         Dr. Hirokazu Anai <>

Numerous problems in science and engineering can be reduced to
symbolic computation problems, which are slightly generalized in the
following way: One has to distinguish between parameters on the one
hand and main variables on the other hand. Therefore devising
parametric variants of computer algebra algorithms will have a
significant impact on those areas. In particular, effective
parametric/nonconvex constraint solving and optimization methods are
strongly required in wide area of industrial manufacturing and
science. This includes but is not limited to:

- loop parallelization,
- software verification,
- analysis and design of differential equations,
- system design in control, signal processing etc.

This session will emphasize methods that use computer algebra
techniques such as Groebner bases or quantifier elimination.


The session is devoted to research

- on mathematical theories, which have a direct practical application
- algorithms (symbolic, symbolic-numeric),
- software libraries/packages,
- applications in science and engineering

for efficiently solving parametric problems.





Advances to the canonical discussion of polynomial systems with parameters
Antonio Montes (Universitat Polit\`ecnica de Catalunya, Spain)
Computation of Full Comprehensive Groebner Bases using Groebner Bases
Akira Suzuki (Kobe University, Japan)
Comprehensive Groebner Bases for Modules
Katsusuke Nabeshima (RISC-Linz, Austria)
On quantifier elimination for Calculus of Sets
Yosuke Sato (Tokyo University of Science, Japan)
Univariate Weak Quantifier Elimination for the Integers
Aless Lasaruk (Univ. of Passau, Germany)
Quantifier elimination for real algebra: the quadratic, cubic and  quartic case
Ioannis Z. Emiris and Elias P. Tsigaridas 
(National Kapodistrian University of Athens, Greece)
Survey of Rigorous Conditions for High Cell-Type Diversity  over Multicellular Organisms by Quantifier Elimination
Hiroshi Yoshida (University of Tokyo, Japan) 
Stability for parametric linear ODEs
Volker Weispfenning (University of Passau, Germany)
Parametric Normal Forms in Digital Communications
Jerome Lebrun (CNRS, France)
Approximation of C-space Obstacles using Interval Evaluation
Natee Tongsiri (RISC-Linz, Austria)