Nidhi Kaihnsa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nidhi Kaihnsa has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Anne Shiu
Texas A&M University, College Station, USA
3 shared publications - Anh Tuan Nguyen
Department of Mathematics Texas A & M University
2 shared publications - Badal Joshi
Department of Mathematics California State University San Marcos
2 shared publications - Elisenda Feliu
Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark
2 shared publications - Timo de Wolff
Institute of Analysis and Algebra Technical University of Braunschweig Braunschweig Germany
2 shared publications Anne Shiu
Texas A&M Univ, College Stn, TX USA
1 shared publication
Latest Publications
- Open Access
- 4 November 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (12) , 1-45
Connectivity of Parameter Regions of Multistationarity for Multisite Phosphorylation Networks
The parameter region of multistationarity of a reaction network contains all the parameters for which the associated dynamical system exhibits multiple steady states. Describing this region is challenging and remains an active area of research. In this paper, we concentrate on two biologically relevant families of reaction networks that model multisite phosphorylation and dephosphorylation of a substrate at n sites. For small values of n, it had previously been shown that the parameter region of multistationarity is connected. Here, we extend these results and provide a proof that applies to all values of n. Our techniques are based on the study of the critical polynomial associated with these reaction networks together with polyhedral geometric conditions of the signed support of this polynomial.
- 4 November 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (12) , 1-45
Open AccessConnectivity of Parameter Regions of Multistationarity for Multisite Phosphorylation Networks
The parameter region of multistationarity of a reaction network contains all the parameters for which the associated dynamical system exhibits multiple steady states. Describing this region is challenging and remains an active area of research. In this paper, we concentrate on two biologically relevant families of reaction networks that model multisite phosphorylation and dephosphorylation of a substrate at n sites. For small values of n, it had previously been shown that the parameter region of multistationarity is connected. Here, we extend these results and provide a proof that applies to all values of n. Our techniques are based on the study of the critical polynomial associated with these reaction networks together with polyhedral geometric conditions of the signed support of this polynomial.
- Open Access
- 2 January 2024
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (4) , 566-600
Absolute concentration robustness and multistationarity in reaction networks: Conditions for coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state, while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least three species, five complexes and three reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory.
- 2 January 2024
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 35 (4) , 566-600
Open AccessAbsolute concentration robustness and multistationarity in reaction networks: Conditions for coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state, while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least three species, five complexes and three reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory.
- 20 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 83 (6) , 2260-2283
Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks and prove edge-probability thresholds at which, with high probability, multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero and the other “lifting” multistationarity from small networks to larger ones.
- 20 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 83 (6) , 2260-2283
Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks and prove edge-probability thresholds at which, with high probability, multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero and the other “lifting” multistationarity from small networks to larger ones.
- 4 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2024-2053
Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation NetworksMultisite phosphorylation is a signaling mechanism well known to give rise to multiple steady states, a property termed multistationarity. When phosphorylation occurs in a sequential and distributive manner, we obtain a family of networks indexed by the number of phosphorylation sites [Formula: see text]. This work addresses the problem of understanding the parameter region where this family of networks displays multistationarity, by focusing on the projection of this region onto the set of kinetic parameters. The problem is phrased in the context of real algebraic geometry and reduced to studying whether a polynomial, defined as the determinant of a parametric matrix of size three, attains negative values over the positive orthant. The coefficients of the polynomial are functions of the kinetic parameters. For any [Formula: see text], we provide sufficient conditions for the polynomial to be positive and, hence, preclude multistationarity, and also sufficient conditions for it to attain negative values and, hence, enable multistationarity. These conditions are derived by exploiting the structure of the polynomial and its Newton polytope and employing circuit polynomials. A relevant consequence of our results is that the sets of kinetic parameters that enable or preclude multistationarity are both connected for all [Formula: see text].
- 4 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2024-2053
Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation NetworksMultisite phosphorylation is a signaling mechanism well known to give rise to multiple steady states, a property termed multistationarity. When phosphorylation occurs in a sequential and distributive manner, we obtain a family of networks indexed by the number of phosphorylation sites [Formula: see text]. This work addresses the problem of understanding the parameter region where this family of networks displays multistationarity, by focusing on the projection of this region onto the set of kinetic parameters. The problem is phrased in the context of real algebraic geometry and reduced to studying whether a polynomial, defined as the determinant of a parametric matrix of size three, attains negative values over the positive orthant. The coefficients of the polynomial are functions of the kinetic parameters. For any [Formula: see text], we provide sufficient conditions for the polynomial to be positive and, hence, preclude multistationarity, and also sufficient conditions for it to attain negative values and, hence, enable multistationarity. These conditions are derived by exploiting the structure of the polynomial and its Newton polytope and employing circuit polynomials. A relevant consequence of our results is that the sets of kinetic parameters that enable or preclude multistationarity are both connected for all [Formula: see text].
- Open Access
Absolute Concentration Robustness and Multistationarity in Reaction Networks: Conditions for Coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state; while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least $3$ species, $5$ complexes, and $3$ reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory.Open AccessAbsolute Concentration Robustness and Multistationarity in Reaction Networks: Conditions for Coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state; while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least $3$ species, $5$ complexes, and $3$ reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory. - Open Access
Prevalence of multistationarity and absolute concentration robustness in reaction networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks, and prove edge-probability thresholds at which - with high probability - multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero, and the other "lifting" multistationarity from small networks to larger ones.
Open AccessPrevalence of multistationarity and absolute concentration robustness in reaction networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks, and prove edge-probability thresholds at which - with high probability - multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero, and the other "lifting" multistationarity from small networks to larger ones.
- Open Access
The kinetic space of multistationarity in dual phosphorylation
Multistationarity in molecular systems underlies switch-like responses in cellular decision making. Determining whether and when a system displays multistationarity is in general a difficult problem. In this work we completely determine the set of kinetic parameters that enable multistationarity in a ubiquitous motif involved in cell signaling, namely a dual phosphorylation cycle. In addition we show that the regions of multistationarity and monostationarity are both path connected. We model the dynamics of the concentrations of the proteins over time by means of a parametrized polynomial ordinary differential equation (ODE) system arising from the mass-action assumption. Since this system has three linear first integrals defined by the total amounts of the substrate and the two enzymes, we study for what parameter values the ODE system has at least two positive steady states after suitably choosing the total amounts. We employ a suite of techniques from (real) algebraic geometry, which in particular concern the study of the signs of a multivariate polynomial over the positive orthant and sums of nonnegative circuit polynomials.
Open AccessThe kinetic space of multistationarity in dual phosphorylation
Multistationarity in molecular systems underlies switch-like responses in cellular decision making. Determining whether and when a system displays multistationarity is in general a difficult problem. In this work we completely determine the set of kinetic parameters that enable multistationarity in a ubiquitous motif involved in cell signaling, namely a dual phosphorylation cycle. In addition we show that the regions of multistationarity and monostationarity are both path connected. We model the dynamics of the concentrations of the proteins over time by means of a parametrized polynomial ordinary differential equation (ODE) system arising from the mass-action assumption. Since this system has three linear first integrals defined by the total amounts of the substrate and the two enzymes, we study for what parameter values the ODE system has at least two positive steady states after suitably choosing the total amounts. We employ a suite of techniques from (real) algebraic geometry, which in particular concern the study of the signs of a multivariate polynomial over the positive orthant and sums of nonnegative circuit polynomials.
- Open Access
Coordinate-wise Powers of Algebraic Varieties
We introduce and study coordinate-wise powers of subvarieties of $\mathbb{P}^n$, i.e. varieties arising from raising all points in a given subvariety of $\mathbb{P}^n$ to the $r$-th power, coordinate by coordinate. This corresponds to studying the image of a subvariety of $\mathbb{P}^n$ under the quotient of $\mathbb{P}^n$ by the action of the finite group $\mathbb{Z}_r^{n+1}$. We determine the degree of coordinate-wise powers and study their defining equations, particularly for hypersurfaces and linear spaces. Applying these results, we compute the degree of the variety of orthostochastic matrices and determine iterated dual and reciprocal varieties of power sum hypersurfaces. We also establish a link between coordinate-wise squares of linear spaces and the study of real symmetric matrices with a degenerate eigenspectrum.Open AccessCoordinate-wise Powers of Algebraic Varieties
We introduce and study coordinate-wise powers of subvarieties of $\mathbb{P}^n$, i.e. varieties arising from raising all points in a given subvariety of $\mathbb{P}^n$ to the $r$-th power, coordinate by coordinate. This corresponds to studying the image of a subvariety of $\mathbb{P}^n$ under the quotient of $\mathbb{P}^n$ by the action of the finite group $\mathbb{Z}_r^{n+1}$. We determine the degree of coordinate-wise powers and study their defining equations, particularly for hypersurfaces and linear spaces. Applying these results, we compute the degree of the variety of orthostochastic matrices and determine iterated dual and reciprocal varieties of power sum hypersurfaces. We also establish a link between coordinate-wise squares of linear spaces and the study of real symmetric matrices with a degenerate eigenspectrum.