<p>We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the algorithm computes a witness set, namely a finite set obtained by intersecting the component with a generic linear variety of complementary dimension. The complexity of the algorithm is polynomial in combinatorial invariants associated to the supports of the polynomials involved.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Sparse systems and algorithmic equidimensional decomposition

  • María Isabel Herrero,
  • Gabriela Jeronimo,
  • Juan Sabia

摘要

We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the algorithm computes a witness set, namely a finite set obtained by intersecting the component with a generic linear variety of complementary dimension. The complexity of the algorithm is polynomial in combinatorial invariants associated to the supports of the polynomials involved.