Binomiality testing and computing sparse polynomials via witness sets (Q2155632)

The authors deals with the problem of deciding whether an sparse polynomial vanishes on a given algebraic set. They motivate the problem via some applications and comment the achievements, as well as the techniques used as tropical geometry matrix theory or computational number theory, by other authors on the topic. In this paper, they deal with the computation of all polynomials, of a fix degree having at most a fixed upper bound of terms, that vanish on an algebraic set that is represented by a witness set. They present algorithms and illustrate their method through with examples from kinematics, chemical reaction and networks.