A family of sparse polynomial systems arising in chemical reaction systems

From MaRDI portal
Publication:1599548

DOI10.1006/jsco.2001.0512zbMath0994.92040OpenAlexW2164003937MaRDI QIDQ1599548

Birkett Huber, Karin Gatermann

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0ae459f213499293c2eb69ffd51b1477961a2c9b




Related Items

The rational parameterisation theorem for multisite post-translational modification systemsON THE RELATION BETWEEN ORGANIZATIONS AND LIMIT SETS IN CHEMICAL REACTION SYSTEMSComputing Hopf Bifurcations in Chemical Reaction Networks Using Reaction CoordinatesPoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction NetworksA linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theoremDetection of Hopf bifurcations in chemical reaction networks using convex coordinatesChemical reaction systems with toric steady statesA linear programming approach to weak reversibility and linear conjugacy of chemical reaction networksMonotonicity of interleukin-1 receptor-ligand binding with respect to antagonist in the presence of decoy receptorTranslated chemical reaction networksAn observer for mass-action chemical reaction networksA feedback control perspective on models of apoptosis signal transductionToric ideals and graph theory to analyze Hopf bifurcations in mass action systemsOn the number of steady states in a multiple futile cycleMultistationarity in the activation of a MAPK: parametrizing the relevant region in parameter spaceBernstein's second theorem and Viro's method for sparse polynomial systems in chemistryToric dynamical systemsPrefaceExploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decompositionSymbolic computation for the qualitative theory of differential equations



Cites Work