Searcharxiv⌕ Search

arXiv subjects

Elisenda Feliu

Publications and source records attributed to Elisenda Feliu.

50 records · Page 3Linked to original sources
arXiv2014

Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry

We give necessary and sufficient conditions in terms of sign vectors for the injectivity of families of polynomial maps with arbitrary real exponents defined on the positive orthant. Our work relates and extends existing injectivity conditions expressed in terms of Jacobian matrices and determinants. In the context of chemical reaction networks with power-law kinetics, our results can be used to preclude as well as to guarantee multiple positive steady states. In the context of real algebraic geometry,our work recognizes a prior result of Craciun, Garcia-Puente, and Sottile, together with work of two of the authors, as the first partial multivariate generalization of the classical Descartes' rule, which bounds the number of positive real roots of a univariate real polynomial in terms of the number of sign variations of its coefficients.

math.AG↗
arXiv2014

Finding the positive feedback loops underlying multi-stationarity

Bistability is ubiquitous in biological systems. For example, bistability is found in many reaction networks that involve the control and execution of important biological functions, such as signalling processes. Positive feedback loops, composed of species and reactions, are necessary for bistability, and generally for multi-stationarity, to occur. These loops are therefore often used to illustrate and pinpoint the parts of a multi-stationary network that are relevant (`responsible') for the observed multi-stationarity. However positive feedback loops are generally abundant in reaction networks but not all of them are important for subsequent interpretation of the network's dynamics. We present an automated procedure to determine the relevant positive feedback loops of a multi-stationary reaction network. The procedure only reports the loops that are relevant for multi-stationarity (that is, when broken multi-stationarity disappears) and not all positive feedback loops of the network. We show that the relevant positive feedback loops must be understood in the context of the network (one loop might be relevant for one network, but cannot create multi-stationarity in another). Finally, we demonstrate the procedure by applying it to several examples of signaling processes, including a ubiquitination and an apoptosis network, and to models extracted from the Biomodels database. We have developed and implemented an automated procedure to find relevant positive feedback loops in reaction networks. The results of the procedure are useful for interpretation and summary of the network's dynamics.

q-bio.MN↗
arXiv2013

Power-law Kinetics and Determinant Criteria for the Preclusion of Multistationarity in Networks of Interacting Species

We present determinant criteria for the preclusion of non-degenerate multiple steady states in networks of interacting species. A network is modeled as a system of ordinary differential equations in which the form of the species formation rate function is restricted by the reactions of the network and how the species influence each reaction. We characterize families of so-called power-law kinetics for which the associated species formation rate function is injective within each stoichiometric class and thus the network cannot exhibit multistationarity. The criterion for power-law kinetics is derived from the determinant of the Jacobian of the species formation rate function. Using this characterization we further derive similar determinant criteria applicable to general sets of kinetics. The criteria are conceptually simple, computationally tractable and easily implemented. Our approach embraces and extends previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on graphical analysis of the interaction graph associated to the system. Further, we interpret the criteria in terms of circuits in the so-called DSR-graph

math.DS↗
arXiv2012

Cellular compartments cause multistability in biochemical reaction networks and allow cells to process more information

Many biological, physical, and social interactions have a particular dependence on where they take place. In living cells, protein movement between the nucleus and cytoplasm affects cellular response (i.e., proteins must be present in the nucleus to regulate their target genes). Here we use recent developments from dynamical systems and chemical reaction network theory to identify and characterize the key-role of the spatial organization of eukaryotic cells in cellular information processing. In particular the existence of distinct compartments plays a pivotal role in whether a system is capable of multistationarity (multiple response states), and is thus directly linked to the amount of information that the signaling molecules can represent in the nucleus. Multistationarity provides a mechanism for switching between different response states in cell signaling systems and enables multiple outcomes for cellular-decision making. We find that introducing species localization can alter the capacity for multistationarity and mathematically demonstrate that shuttling confers flexibility for and greater control of the emergence of an all-or-none response.

q-bio.MN↗
arXiv2011

Preclusion of switch behavior in reaction networks with mass-action kinetics

We provide a Jacobian criterion that applies to arbitrary chemical reaction networks taken with mass-action kinetics to preclude the existence of multiple positive steady states within any stoichiometric class for any choice of rate constants. We are concerned with the characterization of injective networks, that is, networks for which the species formation rate function is injective in the interior of the positive orthant within each stoichiometric class. We show that a network is injective if and only if the determinant of the Jacobian of a certain function does not vanish. The function consists of components of the species formation rate function and a maximal set of independent conservation laws. The determinant of the function is a polynomial in the species concentrations and the rate constants (linear in the latter) and its coefficients are fully determined. The criterion also precludes the existence of degenerate steady states. Further, we relate injectivity of a chemical reaction network to that of the chemical reaction network obtained by adding outflow, or degradation, reactions for all species.

math.AG↗
arXiv2011

Exact Analysis of Intrinsic Qualitative Features of Phosphorelays using Mathematical Models

Phosphorelays are a class of signaling mechanisms used by cells to respond to changes in their environment. Phosphorelays (of which two-component systems constitute a special case) are particularly abundant in prokaryotes and have been shown to be involved in many fundamental processes such as stress response, osmotic regulation, virulence, and chemotaxis. We develop a general model of phosphorelays extending existing models of phosphorelays and two-component systems. We analyze the model analytically under the assumption of mass-action kinetics and prove that a phosphorelay has a unique stable steady-state. Furthermore, we derive explicit functions relating stimulus to the response in any layer of a phosphorelay and show that a limited degree of ultrasensitivity (the ability to respond to changes in stimulus in a switch-like manner) in the bottom layer of a phosphorelay is an intrinsic feature which does not depend on any reaction rates or substrate amounts. On the other hand, we show how adjusting reaction rates and substrate amounts may lead to higher degrees of ultrasensitivity in intermediate layers. The explicit formulas also enable us to prove how the response changes with alterations in stimulus, kinetic parameters, and substrate amounts. Aside from providing biological insight, the formulas may also be used to avoid time-consuming simulations in numerical analyses and simulations.

q-bio.MN↗
arXiv2011

Variable elimination in chemical reaction networks with mass action kinetics

We consider chemical reaction networks taken with mass action kinetics. The steady states of such a system are solutions to a system of polynomial equations. Even for small systems the task of finding the solutions is daunting. We develop an algebraic framework and procedure for linear elimination of variables. The procedure reduces the variables in the system to a set of "core" variables by eliminating variables corresponding to a set of non-interacting species. The steady states are parameterized algebraically by the core variables, and a graphical condition is given for when a steady state with positive core variables necessarily have all variables positive. Further, we characterize graphically the sets of eliminated variables that are constrained by a conservation law and show that this conservation law takes a specific form.

math.DS↗
arXiv2011

Variable elimination in post-translational modification reaction networks with mass-action kinetics

We define a subclass of Chemical Reaction Networks called Post-Translational Modification systems. Important biological examples of such systems include MAPK cascades and two-component systems which are well-studied experimentally as well as theoretically. The steady states of such a system are solutions to a system of polynomial equations with as many variables as equations. Even for small systems the task of finding the solutions is daunting. We develop a mathematical framework based on the notion of a cut, which provides a linear elimination procedure to reduce the number of variables in the system. The steady states are parameterized algebraically by a set of "core" variables, and the non-negative steady states correspond to non-negative values of the core variables. Further, minimal cuts are the connected components in the species graph and provide conservation laws. A criterion for when a set of independent conservation laws can be derived from cuts is given.

q-bio.MN↗
arXiv2011

Enzyme sharing as a cause of multistationarity in signaling systems

Multistationarity in biological systems is a mechanism of cellular decision making. In particular, signaling pathways regulated by protein phosphorylation display features that facilitate a variety of responses to different biological inputs. The features that lead to multistationarity are of particular interest to determine as well as the stability properties of the steady states. In this paper we determine conditions for the emergence of multistationarity in small motifs without feedback that repeatedly occur in signaling pathways. We derive an explicit mathematical relationship between the concentration of a chemical species at steady state and a conserved quantity of the system such as the total amount of substrate available. We show that the relation determines the number of steady states and provides a necessary condition for a steady state to be stable, that is, to be biologically attainable. Further, we identify characteristics of the motifs that lead to multistationarity, and extend the view that multistationarity in signaling pathways arises from multisite phosphorylation. Our approach relies on mass-action kinetics and the conclusions are drawn in full generality without resorting to simulations or random generation of parameters. The approach is extensible to other systems.

q-bio.SC↗
arXiv2010

An Algebraic Approach to Signaling Cascades with n Layers

Posttranslational modification of proteins is key in transmission of signals in cells. Many signaling pathways contain several layers of modification cycles that mediate and change the signal through the pathway. Here, we study a simple signaling cascade consisting of n layers of modification cycles, such that the modified protein of one layer acts as modifier in the next layer. Assuming mass-action kinetics and taking the formation of intermediate complexes into account, we show that the steady states are solutions to a polynomial in one variable, and in fact that there is exactly one steady state for any given total amounts of substrates and enzymes. We demonstrate that many steady state concentrations are related through rational functions, which can be found recursively. For example, stimulus-response curves arise as inverse functions to explicit rational functions. We show that the stimulus-response curves of the modified substrates are shifted to the left as we move down the cascade. Further, our approach allows us to study enzyme competition, sequestration and how the steady state changes in response to changes in the total amount of substrates. Our approach is essentially algebraic and follows recent trends in the study of posttranslational modification systems.

q-bio.QM↗
arXiv2009

Adams operations on higher arithmetic K-theory

We construct Adams operations on the rational higher arithmetic K-groups of a proper arithmetic variety. The definition applies to the higher arithmetic K-groups given by Takeda as well as to the groups suggested by Deligne and Soule, by means of the homotopy groups of the homotopy fiber of the regulator map. They are compatible with the Adams operations on algebraic K-theory. The definition relies on the chain morphism representing Adams operations in higher algebraic K-theory given previously by the author. In this paper it is shown that a slight modification of this chain morphism commutes strictly with the representative of the Beilinson regulator given by Burgos and Wang.

math.KT↗
arXiv2009

A chain morphism for Adams operations on rational algebraic K-theory

For any regular noetherian scheme X and every k>0, we define a chain morphism between two chain complexes whose homology with rational coefficients is isomorphic to the algebraic K-groups of X tensored by the field of rational numbers. It is shown that these morphisms induce in homology the Adams operations defined by Gillet and Soule or the ones defined by Grayson.

math.KT↗
arXiv2008

On uniqueness of characteristic classes

We give an axiomatic characterization of maps from algebraic K-theory. The results apply to a class of maps from algebraic K-theory to any suitable cohomology theory or to algebraic K-theory, which includes all group morphisms. In particular, we obtain comparison theorems for the Chern character and Chern classes and for the Lambda and Adams operations on higher algebraic K-theory. We show that the Adams operations defined by Grayson agree with the ones defined by Gillet and Soule.

math.KT↗