Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Conditions for Solvability in Chemical Reaction Networks at Quasi-Steady-State

Ophelia Adams

TL;DR

This work addresses when quasi-steady-state reductions of chemical reaction networks (CRNs) yield solutions expressible by radicals. It develops a framework linking rate-law polynomial structure, parameter specialization, and graph-based network topology to guarantee solvability for a broad class of CRNs, emphasizing the finiteness of steady states via elimination ideals and saturation (I_Q:(xy)^∞). Key contributions include simple solvability criteria based on I_Q ∩ k[x_q], a finiteness theorem for two intermediates, and a treelike graph criterion (QOSR) ensuring solvability for nonboundary steady states, with demonstrations that certain insolvable examples are minimal. The results illuminate why QSSA reductions often succeed in practice and provide practical tools for verifying solvability and guiding model reduction in chemistry and engineering, while outlining open questions about Galois groups and higher-complexity networks.

Abstract

The quasi-steady-state assumption (QSSA) is an approximation that is widely used in chemistry and chemical engineering to simplify reaction mechanisms. The key step in the method requires a solution by radicals of a system of multivariate polynomials. However, Pantea, Gupta, Rawlings, and Craciun showed that there exist mechanisms for which the associated polynomials are not solvable by radicals, and hence reduction by QSSA is not possible. In practice, however, reduction by QSSA always succeeds. To provide some explanation for this phenomenon, we prove that solvability is guaranteed for a class of common chemical reaction networks. In the course of establishing this result, we examine the question of when it is possible to ensure that there are finitely many (quasi) steady states. We also apply our results to several examples, in particular demonstrating the minimality of the nonsolvable example presented by Pantea, Gupta, Rawlings, and Craciun.

Conditions for Solvability in Chemical Reaction Networks at Quasi-Steady-State

TL;DR

This work addresses when quasi-steady-state reductions of chemical reaction networks (CRNs) yield solutions expressible by radicals. It develops a framework linking rate-law polynomial structure, parameter specialization, and graph-based network topology to guarantee solvability for a broad class of CRNs, emphasizing the finiteness of steady states via elimination ideals and saturation (I_Q:(xy)^∞). Key contributions include simple solvability criteria based on I_Q ∩ k[x_q], a finiteness theorem for two intermediates, and a treelike graph criterion (QOSR) ensuring solvability for nonboundary steady states, with demonstrations that certain insolvable examples are minimal. The results illuminate why QSSA reductions often succeed in practice and provide practical tools for verifying solvability and guiding model reduction in chemistry and engineering, while outlining open questions about Galois groups and higher-complexity networks.

Abstract

The quasi-steady-state assumption (QSSA) is an approximation that is widely used in chemistry and chemical engineering to simplify reaction mechanisms. The key step in the method requires a solution by radicals of a system of multivariate polynomials. However, Pantea, Gupta, Rawlings, and Craciun showed that there exist mechanisms for which the associated polynomials are not solvable by radicals, and hence reduction by QSSA is not possible. In practice, however, reduction by QSSA always succeeds. To provide some explanation for this phenomenon, we prove that solvability is guaranteed for a class of common chemical reaction networks. In the course of establishing this result, we examine the question of when it is possible to ensure that there are finitely many (quasi) steady states. We also apply our results to several examples, in particular demonstrating the minimality of the nonsolvable example presented by Pantea, Gupta, Rawlings, and Craciun.

Paper Structure

This paper contains 13 sections, 15 theorems, 67 equations, 3 figures.

Table of Contents

  1. Introduction
  2. Background
  3. Chemical Reaction Networks
  4. Quasi-Steady-State Assumption
  5. Definitions
  6. Main Results
  7. Properties of Rate Law Polynomials
  8. Specialization of Parameters
  9. Simple Solvability Criteria
  10. Criterion for Finitely Many Quasi-Steady-States
  11. Graph-Theoretical Criteria for Solvability
  12. Examples
  13. Discussion

Key Result

Proposition 13

The coefficients $c_\alpha$ and $c_\beta$ of distinct monomials $x^\alpha$ and $x^\beta$ of rate law polynomials depend on disjoint sets of rate constants.

Figures (3)

  • Figure 1: \newlabelfig:intro0 Example of a chemical reaction network, the corresponding differential equations, and the OSR graph.
  • Figure 2: \newlabelfig:pantea0 QOSR graph for the mechanism in Example \ref{['exorig']}, taken from Pantea et. al pantea.
  • Figure 3: \newlabelfig:saturation0 QOSR graph for the modified Pantea mechanism of Example \ref{['panteatweakex']}. The deleted edge is dashed and marked in red, and regions are drawn around the graph to denote equivalence classes used in applying Theorem \ref{['treethm']}.

Theorems & Definitions (48)

  • Definition 1
  • Definition 2
  • Definition 3
  • Definition 4
  • Definition 5
  • Definition 6
  • Definition 7
  • Definition 8
  • Definition 9
  • Definition 10
  • ...and 38 more