arXiv subjects

Matthias Seiß

Publications and source records attributed to Matthias Seiß.

4 recordsLinked to original sources

arXiv2023

A Computational Approach to Polynomial Conservation Laws

For polynomial ODE models, we introduce and discuss the concepts of exact and approximate conservation laws, which are the first integrals of the full and truncated sets of ODEs. For fast-slow systems, truncated ODEs describe the fast dynamics. We define compatibility classes as subsets of the state space, obtained by equating the conservation laws to constants. A set of conservation laws is complete when the corresponding compatibility classes contain a finite number of steady states. Complete sets of conservation laws can be used for model order reduction and for studying the multistationarity of the model. We provide algorithmic methods for computing linear, monomial, and polynomial conservation laws of polynomial ODE models and for testing their completeness. The resulting conservation laws and their completeness are either independent or dependent on the parameters. In the latter case, we provide parametric case distinctions. In particular, we propose a new method to compute polynomial conservation laws by comprehensive Gröbner systems and syzygies. Keywords: First integrals, chemical reaction networks, polynomial conservation laws, syzygies, comprehensive Gröbner systems.

math.DS↗

arXiv2023

Reduction of Chemical Reaction Networks with Approximate Conservation Laws

Model reduction of fast-slow chemical reaction networks based on the quasi-steady state approximation fails when the fast subsystem has first integrals. We call these first integrals approximate conservation laws. In order to define fast subsystems and identify approximate conservation laws, we use ideas from tropical geometry. We prove that any approximate conservation law evolves slower than all the species involved in it and therefore represents a supplementary slow variable in an extended system. By elimination of some variables of the extended system, we obtain networks without approximate conservation laws, which can be reduced by standard singular perturbation methods. The field of applications of approximate conservation laws covers the quasi-equilibrium approximation, well known in biochemistry. We discuss reductions of slow-fast as well as multiple timescale systems. Networks with multiple timescales have hierarchical relaxation. At a given timescale, our multiple timescale reduction method defines three subsystems composed of (i) slaved fast variables satisfying algebraic equations, (ii) slow driving variables satisfying reduced ordinary differential equations, and (iii) quenched much slower variables that are constant. The algebraic equations satisfied by fast variables define chains of nested normally hyberbolic invariant manifolds. In such chains, faster manifolds are of higher dimension and contain the slower manifolds. Our reduction methods are introduced algorithmically for networks with monomial reaction rates and linear, monomial or polynomial approximate conservation laws. We propose symbolic algorithms to reshape and rescale the networks such that geometric singular perturbation theory can be applied to them, test the applicability of the theory, and finally reduce the networks. As a proof of concept, we apply this method to a model of the TGF-b signaling pathway.

math.DS↗

arXiv2020

Root Parametrized Differential Equations for the classical groups

Let $C \langle t_1, \dots t_l\rangle$ be the differential field generated by $l$ differential indeterminates $\boldsymbol{t}=(t_1, \dots ,t_l)$ over an algebraically closed field $C$ of characteristic zero. We develop a lower bound criterion for the differential Galois group $G(C)$ of a matrix parameter differential equation $\partial(\boldsymbol{y})=A(\boldsymbol{t})\boldsymbol{y}$ over $C \langle t_1, \dots t_l\rangle$ and we prove that every connected linear algebraic group is the Galois group of a linear parameter differential equation over $C\langle t_1 \rangle$. As a second application we compute explicit and nice linear parameter differential equations over $C\langle t_1, \dots, t_l \rangle$ for the groups $\mathrm{SL}_{l+1}(C)$, $\mathrm{SP}_{2l}(C)$, $\mathrm{SO}_{2l+1}(C)$, $\mathrm{SO}_{2l}(C)$, i.e. for the classical groups of type $A_l$, $B_l$, $C_l$, $D_l$, and for $\mathrm{G}_2$ (here $l=2$).

math.RA↗

arXiv2016

A Root Parametrized Differential Equation for the Special Linear Group

Let $C \langle \boldsymbol{t} \rangle$ be the differential field generated by $l$ differential indeterminates $\boldsymbol{t}=(t_1, \dots, t_l)$ over an algebraically closed field $C$ of characteristic zero. In this article we present an explicit linear parameter differential equation over $C \langle \boldsymbol{t} \rangle$ with differential Galois group $\mathrm{SL}_{l+1}(C)$ and show that it is a generic equation in the following sense: If $F$ is an algebraically closed differential field with constants $C$ and $E/F$ is a Picard-Vessiot extension with differential Galois group $H(C) \subseteq \mathrm{SL}_{l+1}(C)$, then a specialization of our equation defines a Picard-Vessiot extension differentially isomorphic to $E/F$.

math.AC↗