Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.08859

Computing with reaction networks at input-independent speed: exponential and logarithmic functions

David F. Anderson·Badal Joshi·Tung D. Nguyen
View original source ↗Read source document ↗Export metadata ↓

Abstract

The concept of \textit{input-independent computational speed} for chemistry-based analog computers was introduced in Anderson-Joshi (2025), where it was shown that arithmetic operations can be computed with a convergence rate bounded below independently of the input values. Here, by inputs we mean the numerical values encoded by the initial concentrations of designated input species, with the underlying reaction network and rate constants held fixed. Combining these operations via power series to approximate transcendental functions is possible in principle, but the number of chemical species required grows with the number of terms retained, and achieving sufficient accuracy may demand many terms---a burden that is especially severe for slowly converging series such as the power series for the logarithm. In this paper, we begin the program of directly computing transcendental functions by chemical reaction networks by focusing on the exponential and logarithmic functions, two widely used transcendental functions, and constructing reaction network modules that compute them without relying on truncated power series. We show that the resulting modules are mass-action systems, and prove that they achieve arbitrary accuracy given sufficient time while operating at input-independent speed. Moreover, these modules can be combined with each other and with the arithmetic modules of Anderson-Joshi (2025): any such composite computation also runs at input-independent speed, with a convergence rate that does not depend on the length of the feedforward chain. Logarithm and exponential functions serve as foundational cases, and the constructions developed here are intended to serve as templates for the direct computation of more general transcendental functions by chemical reaction networks.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David F. Anderson, Badal Joshi, Tung D. Nguyen. 2026-08-26. Computing with reaction networks at input-independent speed: exponential and logarithmic functions. https://arxiv.org/abs/2604.08859

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

KEEP EXPLORING

Related papers

arXiv2026

Measures of maximal entropy for $C^\infty$ three-dimensional flows

We prove that every $C^\infty$ non-singular flow with positive entropy on a compact three-dimensional manifold without boundary admits finitely many ergodic measures of maximal entropy. This result extends the notable work of Buzzi-Crovisier-Sarig (\emph{Ann. of Math.}, 2022) on surface diffeomorphisms. Our approach differs by addressing the continuity of Lyapunov exponents and the uniform largeness of Pesin sets for measures of maximal entropy. Furthermore, it provides an alternative proof for the case of surface diffeomorphisms.

math.DS↗
arXiv2026

Multistationarity in semi-open Phosphorylation-Dephosphorylation Cycles

Multistationarity underlies biochemical switching and cellular decision-making. We study how multistationarity in the sequential $n$-site phosphorylation-dephosphorylation cycle is affected when only some species are open, meaning allowed to exchange with the environment (so-called semi-open networks). Working under mass action kinetics, we obtain two complementary structural results for $n\geq$2. First, opening any nonempty subset of the substrate species preserves the network's capacity for nondegenerate multistationarity. Second, opening the enzyme species (both kinase and phosphatase), possibly together with any subset of substrates, always destroys multistationarity. The latter result is proved by a general reduction framework combining the detection of absolute concentration robustness (ACR) with projection onto the remaining species; when the projection produces a monostationary network, the full semi-open system is monostationary. We also illustrate the general method on multi-layer cascade variants and discuss biological implications.

math.DS↗
arXiv2026

Propagation of regularity along unstable manifolds

Let $φ_t : M \to M$ be a flow on a smooth closed connected manifold $M$ that preserves and expands a foliation $F$. We establish a theorem of propagation of regularity along the leaves of $F$ for sections of vector bundles satisfying a transport equation involving the generator of a cocycle over $φ_t$. As a consequence, we prove a regularity result for Pollicott-Ruelle resonant states: if such state is smooth in restriction to a piece of an unstable leaf, then it is in fact smooth over the entire manifold. We also announce further applications related to joint integrability of extreme bundles of partially hyperbolic diffeomorphisms. The proofs rely on a leafwise semiclassical pseudodifferential calculus adapted to a foliated space, which may be of independent interest.

math.DS↗