Friday March 9, 2001 at 10:30am in the PIMS seminar room, SFU.
(NOTE the different room)
Manfred Minimair, North Carolina State University
Efficiently Computing Resultants of Composed Polynomials
Abstract: We talk on efficiently computing resultants of composed polynomials. By the resultant of several polynomials in several variables (one fewer variables than polynomials) we mean an irreducible polynomial in the cofficients of the polynomials that vanishes if they have a common zero. By a composed polynomial we mean the polynomial obtained from a given polynomial by replacing each variable by a polynomial.
We report on four results:
The preprints are available at http://www.math.ncsu.edu/~mminima .