Affine solution sets of sparse polynomial systems (Q1940920)

The aim of the paper under review is to study, both from the theoretic and algorithmic point of view, the equidimensional decomposition of the affine solution set \(V\subset \mathbb{C}^n\) of a sparse polynomial system \(F=(f_1,\ldots,f_n)\) taking into account the support of the \(f_i\)'s where \(f_i\in \mathbb{Q}[x_1,\ldots,x_n]\). Let us fix the support of \(F\). For a generic system \(F\), the authors give combinatorial conditions that yield the components of positive dimension of \(V\). For an arbitrary system \(F\), they obtain an upper bound for the degree of \(V\), and describe an algorithm to compute a finite set of points representing the equidimensional components of \(V\).