Optimal Descartes’ rule of signs for systems supported on circuits

We present an optimal version of Descartes’ rule of signs to bound the number of positive real roots of a sparse system of polynomial equations in n variables with $$n+2$$ monomials. This sharp upper bound is given in terms of the sign variation of a sequence associated to the exponents and the coefficients of the system.