Algorithms for residues and Łojasiewicz exponents (Q1585067)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1526261
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithms for residues and Łojasiewicz exponents
    scientific article; zbMATH DE number 1526261

      Statements

      Algorithms for residues and Łojasiewicz exponents (English)
      0 references
      6 December 2001
      0 references
      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.
      0 references
      0 references
      computational aspects of commutative algebra
      0 references
      polynomial ideal
      0 references
      algebraic residue theory
      0 references
      Bezoutians
      0 references
      algebraic dependence between polynomials
      0 references
      Łojasiewicz exponent
      0 references
      polynomial map
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references