Effective calculations of the multiplicity of polynomial mappings

Let \(F:(\mathbb{C}^{n},0)\rightarrow (\mathbb{C}^{m},0)\) be a holomorphic mapping having an isolated zero at \(0.\) If \(n=m\) then \(F\) has well-defined classic multiplicity \(m_{0}(F)\) at \(0.\) If \(n\neq m\) (then necessarily \(m>n\) ) then one can define an ``improper multiplicity \(i_{0}(F)\) of \(F\) at \(0\) by some procedure reducing it to the improper intersection of two analytic sets: \(\mathrm{graph\,}F\) and \(\mathbb{C}^{n}\times \{0\}\subset \mathbb{C} ^{n}\times \mathbb{C}^{m}\) (see \textit{R. Achilles} et al. [Ann. Pol. Math. 51, 21--36 (1990; Zbl 0796.32006)] and \textit{P. Tworzewski} [Ann. Pol. Math. 62, No. 2, 177--191 (1995; Zbl 0911.32018)]). In the case \(F\) is a polynomial mapping the author gives an effective procedure (an algorithm) for finding linear mappings \(L: \mathbb{C}^{m}\rightarrow \mathbb{C}^{n}\) such that \(i_{0}(F)=m_{0}(L\circ F).\) In this way, he gets an algorithm for calculating the multiplicity of isolated zeros of polynomial mappings.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Effective calculations of the multiplicity of polynomial mappings

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