Leírás
University of Szeged, Bolyai Institute, Differential equations seminar
Abstract. In this talk I cover some of results of my PhD. We first establish the mathematical framework of chemical reaction networks (CRN). Then we start by studying their steady state ideals, giving a faster algorithm to compute Gröbner bases of these ideals. We use this tool to also detect binomiality of the steady state ideal. After gaining some knowledge about binomiality of networks, we introduce an algorithm to compute the multistationarity structure of CRNs with binomial core networks. At the second half of the talk, a new approach for answering questions regarding the parameter region where a network exhibits multistationary behavior will be discussed. All algorithms are algorithmic and have advantages over the other existing algorithms in the literature which will be mentioned as well.