Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

  • Authors:

  • Grégoire Lecerf

  • Affiliations:

  • Laboratoire de Mathématiques, UMR 8100 CNRS, Université de Versailles Si-Quentin-en-Yvelines, 45, Avenue des États-Unis, Bâtiment Fermat, Versailles, 78035 France

  • Venue:
  • Journal of Complexity
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set of such systems. Each equidimensional component is encoded by a generic fiber, that is a finite set of points obtained from the intersection of the component with a generic transverse affine subspace. Our algorithm is incremental in the number of equations to be solved. Its complexity is mainly cubic in the maximum of the degrees of the solution sets of the intermediate systems counting multiplicities.Our method is designed for coefficient fields having characteristic zero or big enough with respect to the number of solutions. If the base field is the field of the rational numbers then the resolution is first performed modulo a random prime number after we have applied a random change of coordinates. Then we search for coordinates with small integers and lift the solutions up to the rational numbers. Our implementation is available within our package Kronecker from version 0.166, which is written in the Magma computer algebra system.