Polynomial Elimination

Organizer

Description

This special session focuses on applying classical and modern elimination algorithms and tools to problems in various domains of science, engineering and industry. Some already successful applications (for example, in mathematical computation, geometric reasoning/modeling/design, system/control theory, computer vision/robotics and neural networks) will be surveyed and reported, and still un-attackable problems are to be identified for further research and as challenge to future improvement and development of elimination algorithms and their implementation.

Talks

Date: July 19th (Friday)

08:30-09:00: J. Lyn Miller
Algorithms for Extending Gröbner Bases to Subalgebras and Their Ideals
Abstract
09:00-09:30: Franz Pauer, Andreas Unterkircher
Gröbner Bases for Ideals in Monomial Algebras and Their Application to Systems of Difference Equations
Abstract
09:30-10:00: Lu Yang, Xiao-Rong Hou, Zhen-Bing Zeng
A Complete Discrimination System for Polynomials
Abstract
10:30-11:00: Masayuki Noro, Kazuhiro Yokoyama
An Efficient Method to Compute the Univariate Rational Representation for Zero-dimensional Systems
Abstract
11:00-11:30: Maria Pia Saccomani, Stefania Audoly, Claudio Cobelli, Leontina D'angiò
The Buchberger Algorithm to Study the a Priori Identifiability of Biological Systems Models
Abstract
11:30-12:00: Jean-Charles Faugère, François Moreau de Saint-Martin, Fabrice Rouillier
Design of Nonseparable Bidimensional Wavelets and Filter Banks Using Gröbner Bases Techniques
Abstract

14:00-14:30: Hans J. Stetter
Computer Algebra with Data of Limited Accuracy
Abstract
14:30-15:00: Giuseppa Carrà Ferro
Ritt's Algorithm and Differential Resultants of Two Algebraic ODE's
Abstract
15:00-15:30: Dongming Wang
A Polynomial System from Differential Equations
Abstract
15:30-16:00: Karin Gatermann
Symmetry: A Package for Computation with Invariants and Equivariants
Abstract

________________________________________________________