SearcharxivSearch

arXiv subjects

Hamid Rahkooy

Publications and source records attributed to Hamid Rahkooy.

17 recordsLinked to original sources

Cylindrical Algebraic Decomposition in Macaulay2

CylindricalAlgebraicDecomposition.m2 is the first implementation of Cylindrical Algebraic Decomposition (CAD) in Macaulay2. CAD decomposes space into 'cells' where input polynomials are sign-invariant. This package computes an Open CAD (full-dimensional cells only) for sets of real polynomials with rational coefficients, enabling users to solve existential problems involving strict inequalities. With the construction of a full CAD (cells of all dimensions), this tool could be extended to solve any real quantifier elimination problem. The current implementation employs the Lazard projection and introduces a new heuristic for choosing the variable ordering.

cs.SC

Exact identifiability analysis for a class of partially observed near-linear stochastic differential equation models

Stochasticity plays a key role in many biological systems, necessitating the calibration of stochastic mathematical models to interpret associated data. For model parameters to be estimated reliably, it is typically the case that they must be structurally identifiable. Yet, while theory underlying structural identifiability analysis for deterministic differential equation models is highly developed, there are currently no tools for the general assessment of stochastic models. In this work, we present a differential algebra-based framework for the structural identifiability analysis of linear and a class of near-linear partially observed stochastic differential equation (SDE) models. Our framework is based on a deterministic recurrence relation that describes the dynamics of the statistical moments of the system of SDEs. From this relation, we iteratively form a series of necessarily satisfied equations involving only the observed moments, from which we are able to establish structurally identifiable parameter combinations. We demonstrate our framework for a suite of linear (two- and $n$-dimensional) and non-linear (two-dimensional) models. Most importantly, we define the notion of structural identifiability for SDE models and establish the effect of the initial condition on identifiability. We conclude with a discussion on the applicability and limitations of our approach, and potential future research directions in this understudied area.

stat.ME

On Recurrence Relations of Multi-dimensional Sequences

In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured matrices and computing their kernels. The challenging problem is to reduce the size of the corresponding matrices. In this paper, we show how to convert the problem of computing recurrence relations of multi-dimensional sequences into computing the orthogonal of certain ideals as subvector spaces of the dual module of polynomials. We propose an algorithm using efficient dual module computation algorithms. We present a complexity bound for this algorithm, carry on experiments using Maple implementation, and discuss the cases when using this algorithm is much faster than the existing approaches.

cs.SC

Algebraic identifiability of partial differential equation models

Differential equation models are crucial to scientific processes. The values of model parameters are important for analyzing the behaviour of solutions. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. To determine if a parameter estimation problem is well-posed for a given model, one must check if the model parameters are globally identifiable. This problem has been intensively studied for ordinary differential equation models, with theory and several efficient algorithms and software packages developed. A comprehensive theory of algebraic identifiability for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences.

q-bio.QM

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\"obner systems and syzygies. Keywords: First integrals, chemical reaction networks, polynomial conservation laws, syzygies, comprehensive Gr\"obner systems.

math.DS

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

On the algebraic structures in $\A_Φ(G)$

Let $G$ be a locally compact group and $(Φ, Ψ)$ be a complementary pair of $N$-functions. In this paper, using the powerful tool of porosity, it is proved that when $G$ is an amenable group, then the Figà-Talamanca-Herz-Orlicz algebra ${\A}_Φ(G)$ is a Banach algebra under convolution product if and only if $G$ is compact. Then it is shown that ${\A}_Φ(G)$ is a Segal algebra, and as a consequence, the amenability of ${\A}_Φ(G)$ and the existence of a bounded approximate identity for ${\A}_Φ(G)$ under the convolution product is discussed. Furthermore, it is shown that for a compact abelian group $G$, the character space of ${\A}_Φ(G)$ under convolution product can be identified with $\widehat{G}$, the dual of $G$.

math.FA

Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gr\"obner Systems

We consider the problem of binomiality of the steady state ideals of biochemical reaction networks. We are interested in finding polynomial conditions on the parameters such that the steady state ideal of a chemical reaction network is binomial under every specialisation of the parameters if the conditions on the parameters hold. We approach the binomiality problem using Comprehensive Gr\"obner systems. Considering rate constants as parameters, we compute comprehensive Gr\"obner systems for various reactions. In particular, we make automatic computations on n-site phosphorylations and biomodels from the Biomodels repository using the grobcov library of the computer algebra system Singular.

q-bio.MN

Parametric Toricity of Steady State Varieties of Reaction Networks

We study real steady state varieties of the dynamics of chemical reaction networks. The dynamics are derived using mass action kinetics with parametric reaction rates. The models studied are not inherently parametric in nature. Rather, our interest in parameters is motivated by parameter uncertainty, as reaction rates are typically either measured with limited precision or estimated. We aim at detecting toricity and shifted toricity, using a framework that has been recently introduced and studied for the non-parametric case over both the real and the complex numbers. While toricity requires that the variety specifies a subgroup of the direct power of the multiplicative group of the underlying field, shifted toricity requires only a coset. In the non-parametric case these requirements establish real decision problems. In the presence of parameters we must go further and derive necessary and sufficient conditions in the parameters for toricity or shifted toricity to hold. Technically, we use real quantifier elimination methods. Our computations on biological networks here once more confirm shifted toricity as a relevant concept, while toricity holds only for degenerate parameter choices.

q-bio.MN

A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks

We study binomiality of the steady state ideals of chemical reaction networks. Considering rate constants as indeterminates, the concept of unconditional binomiality has been introduced and an algorithm based on linear algebra has been proposed in a recent work for reversible chemical reaction networks, which has a polynomial time complexity upper bound on the number of species and reactions. In this article, using a modified version of species--reaction graphs, we present an algorithm based on graph theory which performs by adding and deleting edges and changing the labels of the edges in order to test unconditional binomiality. We have implemented our graph theoretical algorithm as well as the linear algebra one in Maple and made experiments on biochemical models. Our experiments show that the performance of the graph theoretical approach is similar to or better than the linear algebra approach, while it is drastically faster than Groebner basis and quantifier elimination methods.

cs.SC

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks

Motivated by problems from Chemical Reaction Network Theory, we investigate whether steady state ideals of reversible reaction networks are generated by binomials. We take an algebraic approach considering, besides concentrations of species, also rate constants as indeterminates. This leads us to the concept of unconditional binomiality, meaning binomiality for all values of the rate constants. This concept is different from conditional binomiality that applies when rate constant values or relations among rate constants are given. We start by representing the generators of a steady state ideal as sums of binomials, which yields a corresponding coefficient matrix. On these grounds we propose an efficient algorithm for detecting unconditional binomiality. That algorithm uses exclusively elementary column and row operations on the coefficient matrix. We prove asymptotic worst case upper bounds on the time complexity of our algorithm. Furthermore, we experimentally compare its performance with other existing methods.

cs.SC

Efficiently and Effectively Recognizing Toricity of Steady State Varieties

We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of shifted toric varieties which generalizes the notion of toric varieties. This requires a geometric view on the varieties rather than an algebraic view on the ideals. We present algorithms and computations on 129 models from the BioModels repository testing for group and coset structures over both the complex numbers and the real numbers. Our methods over the complex numbers are based on Gröbner basis techniques and binomiality tests. Over the real numbers we use first-order characterizations and employ real quantifier elimination. In combination with suitable prime decompositions and restrictions to subspaces it turns out that almost all models show coset structure. Beyond our practical computations, we give upper bounds on the asymptotic worst-case complexity of the corresponding problems by proposing single exponential algorithms that test complex or real varieties for toricity or shifted toricity. In the positive case, these algorithms produce generating binomials. In addition, we propose an asymptotically fast algorithm for testing membership in a binomial variety over the algebraic closure of the rational numbers.

q-bio.MN

First-Order Tests for Toricity

Motivated by problems arising with the symbolic analysis of steady state ideals in Chemical Reaction Network Theory, we consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a coset of a multiplicative group. That property corresponds to Shifted Toricity, a recent generalization of toricity of the corresponding polynomial ideal. The key idea is to take a geometric view on varieties rather than an algebraic view on ideals. Recently, corresponding coset tests have been proposed for complex and for real varieties. The former combine numerous techniques from commutative algorithmic algebra with Gröbner bases as the central algorithmic tool. The latter are based on interpreted first-order logic in real closed fields with real quantifier elimination techniques on the algorithmic side. Here we take a new logic approach to both theories, complex and real, and beyond. Besides alternative algorithms, our approach provides a unified view on theories of fields and helps to understand the relevance and interconnection of the rich existing literature in the area, which has been focusing on complex numbers, while from a scientific point of view the (positive) real numbers are clearly the relevant domain in chemical reaction network theory. We apply prototypical implementations of our new approach to a set of 129 models from the BioModels repository.

cs.SC

Analysis of the Conradi-Kahle Algorithm for Detecting Binomiality on Biological Models

We analyze the Conradi-Kahle Algorithm for detecting binomiality. We present experiments using two implementations of the algorithm in Macaulay2 and Maple on biological models and assess the performance of the algorithm on these models. We compare the two implementations with each other and with Gröbner bases computations up to their performance on these biological models.

q-bio.MN

Block-Krylov techniques in the context of sparse-FGLM algorithms

Consider a zero-dimensional ideal $I$ in $\mathbb{K}[X_1,\dots,X_n]$. Inspired by Faugère and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices of $I$ in order to compute a description of its zero set by means of univariate polynomials. Steel recently showed how to use Coppersmith's block-Wiedemann algorithm in this context; he describes an algorithm that can be easily parallelized, but only computes parts of the output in this manner. Using generating series expressions going back to work of Bostan, Salvy, and Schost, we show how to compute the entire output for a small overhead, without making any assumption on the ideal $I$ other than it having dimension zero. We then propose a refinement of this idea that partially avoids the introduction of a generic linear form. We comment on experimental results obtained by an implementation based on the C++ libraries Eigen, LinBox and NTL.

cs.SC

On Computing the Elimination Ideal Using Resultants with Applications to Gröbner Bases

Resultants and Gröbner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the bivariate case, in which the elimination ideal is principal. We study - by means of elementary tools - the difference between the multiplicity of the factors of the generator of the elimination ideal and the multiplicity of the factors of the resultant.

math.AC