Symbolic Computation Seminar: Máté Telek , University of Copenhagen, Reaction networks and a generalization of Descartes’ rule of signs to hypersurfaces
SAS 4201The classical Descartes’ rule of signs provides an easily computable upper bound for the number of positive real roots of a univariate polynomial with real coefficients. Descartes' rule of signs is of special importance in applications where positive solutions to polynomial systems are the object of study. This is the case in reaction network theory…