21 citations · 54 across the 9 of their papers we have counts for
Showing 1999 · math.AGShow all
2 papers · 2 filters
math.AG1999
Algorithms for polynomials in two variables
Walter D. Neumann, Penelope G. Wightwick
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient…
math.AG1999
Unfolding polynomial maps at infinity
Walter D. Neumann, Paul Norbury
We give a topological model for a polynomial map from $\C^n$ to $\C$ in the neighborhood of a fiber with isolated singularities. This is motivated out of the ``unfolding of links''…