Speaker
Description
In the bifurcation analysis of biochemical reaction networks, the determinant of the Jacobian of the corresponding ODE system plays a crucial role. When network parameters are treated symbolically, computing this determinant becomes challenging, even for moderately sized systems. This computation can be simplified if one decomposes the network into subnetworks such that the Jacobi determinant factorizes into a product of determinants associated with these subnetworks. One such known decomposition is based on so-called buffering structures. In this talk, we show that buffering structures are not only sufficient but also necessary for a factorization of the Jacobi determinant. Furthermore, we present an effective computational method for detecting buffering structures in a given reaction network.
