Algorithms for residues and Łojasiewicz exponents

DOI10.1016/S0022-4049(99)00083-3MaRDI QIDQ1585067zbMATH OpenFDO

Authors Mohamed Elkadi, Bernard Mourrain

Publication date 6 December 2001

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-4049(99)00083-3

algebraic dependence between polynomials algebraic residue theory Bezoutians computational aspects of commutative algebra polynomial ideal polynomial map Łojasiewicz exponent

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Rational and birational maps (14E05) Symbolic computation and algebraic computation (68W30)

Review text

In this paper, the authors use some matrix techniques based on Bezoutian formulations to compute relations of algebraic dependence between \(n+1\) polynomials in \(n\) variables. They also compute bounds for the size of the involved matrices and for the height of their coefficients. Then, they apply these results to develop different algorithms: One for the computation of residues associated to polynomials, another one which decides whether a polynomial map \(f:\mathbb{C}\to\mathbb{C}\) is proper or not, another one to compute the Łojasiewicz exponent of a family of polynomials, and the last one to decide whether a polynomial map \(f:\mathbb{C}\to\mathbb{C}\) is invertible or not and, in case it is, to compute its inverse.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Algorithms for residues and Łojasiewicz exponents

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