Counting isolated points outside the image of a polynomial map

From MaRDI portal




Abstract: We consider a generic family of polynomial maps f:=(f1,f2):mathbbC2ightarrowmathbbC2 with given supports of polynomials, and degree d(f):=max(degf1,degf2). We show that the (non-) properness of maps f in this family depends uniquely on the pair of supports and that the set of isolated points in mathbbC2setminusf(mathbbC2) has a size of at most 6d(f). This improves an existing upper bound (d(f)1)2 proven by Jelonek. Moreover, for each ninmathbbN, we construct a dominant map f above, with d(f)=2n+2, and having 2n isolated points in mathbbC2setminusf(mathbbC2). Our proofs are constructive and can be adapted to a method for computing isolated missing points of f. As a byproduct, we describe those points in terms of singularities of the bifurcation set of f.









This page was built for publication: Counting isolated points outside the image of a polynomial map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157796)