Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV

Abstract

Consider a projective algebraic variety W which is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than d in n + 1 variables over a field of zero characteristic. Consider a dominant rational morphism from W to W′ given by homogeneous polynomials of degree d′. We suggest algorithms for constructing objects in general position related to this morphism. They generalize some algorithms from the first part of the paper to the case dim W > dim W′. These algorithms are deterministic and polynomial in (dd′)n and the size of the input. Bibliography: 12 titles.