Search arXivSearch

arXiv · 2211.05755

Chemical systems with limit cycles

Abstract

The dynamics of a chemical reaction network (CRN) is often modelled under the assumption of mass action kinetics by a system of ordinary differential equations (ODEs) with polynomial right-hand sides that describe the time evolution of concentrations of chemical species involved. Given an arbitrarily large integer $K \in {\mathbb N}$, we show that there exists a CRN such that its ODE model has at least $K$ stable limit cycles. Such a CRN can be constructed with reactions of at most second order provided that the number of chemical species grows linearly with $K$. Bounds on the minimal number of chemical species and the minimal number of chemical reactions are presented for CRNs with $K$ stable limit cycles and at most second order or seventh order kinetics. We also show that CRNs with only two chemical species can have $K$ stable limit cycles, when the order of chemical reactions grows linearly with $K$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Radek Erban, Hye-Won Kang. 2023-01-04. Chemical systems with limit cycles. https://arxiv.org/abs/2211.05755

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS