Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology

Abstract.

Symbolic methods to investigate Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. However, the symbolic investigations have not been fully algorithmic but required a sequence of symbolic computations intervened with ad hoc insights and decisions made by a human. In this paper we discuss the use of algebraic and logical methods to reduce questions on the existence of Hopf bifurcations in parameterized polynomial vector fields to quantifier elimination problems over the reals combined with the use of the quantifier elimination over the reals and simplification techniques available in REDLOG. We can reconstruct most of the results given in the literature within a few seconds of computation time and extend the investigations on these systems to previously not analyzed related systems. Especially we discuss cases in which one suspects that no Hopf bifurcation fixed point exists for biologically relevant values of parameters and system variables. Here we focus on logical and algebraic techniques of finding subconditions being inconsistent with the hypothesis of the existence of Hopf bifurcation fixed points.