CERLIENCO-MUREDDU CORRESPONDENCE AND LAZARD STRUCTURAL THEOREM

Abstract

This paper is devoted to characterize the shape of polynomial equation systems (viewed as polynomial ideals) with finitely many solutions (counting their multiplicities) and the dual structure of the quotient algebra. Our characterization links both the techniques for solving polynomial systems (Gianni–Kalkbrener Theorem) and the inverse interpolation problem (Möller Algorithm).
Key words: polynomial equations, duality, combinatorial description