Thomas Sturm
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
Thomas Sturm has a total of 132 co-authors. Here are the top co-authors by number of shared publications:
- Andreas Weber
Department of Computer Science, University of Bonn, Bonn, Germany
10 shared publications - Werner M. Seiler
Institut für Mathematik, Universität Kassel, Kassel, Germany
9 shared publications Andreas Dolzmann
8 shared publications- Matthew England
Coventry University, Coventry, UK
8 shared publications - Ovidiu Radulescu
Affiliation Laboratory of Pathogens and Host Immunity, University of Montpellier, CNRS and INSERM, Montpellier, France
6 shared publications - Hamid Rahkooy
CNRS, Inria, and the University of Lorraine, Nancy, France
4 shared publications
Latest Publications
- 9 August 2026
- Published by Springer Nature
- p. 112-132
Pseudo-complex Quantifier Elimination
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 62-69
On the Number of Real Types of Univariate Polynomials
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 62-69
Open AccessOn the Number of Real Types of Univariate Polynomials
- Open Access
- 1 September 2023
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 17 (3-4) , 1-2
Foreword
- 1 September 2023
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 17 (3-4) , 1-2
Open AccessForeword
- 1 September 2022
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 16 (2-3) , 1-2
Foreword
- 1 September 2022
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 16 (2-3) , 1-2
Foreword
- 1 September 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (3) , 369-371
Foreword, with a Dedication to Vladimir Gerdt
- 1 September 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (3) , 369-371
Foreword, with a Dedication to Vladimir Gerdt
- 16 August 2021
- Published by Springer Nature
- p. 314-333
Parametric Toricity of Steady State Varieties of Reaction Networks
- 16 August 2021
- Published by Springer Nature
- p. 314-333
Parametric Toricity of Steady State Varieties of Reaction Networks
- 16 August 2021
- Published by Springer Nature
- p. 334-352
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems
- 16 August 2021
- Published by Springer Nature
- p. 334-352
Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems
- Open Access
- 8 July 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (3) , 499-534
Algorithmic Reduction of Biological Networks with Multiple Time Scales
We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical reaction networks for cellular biochemistry, and compartmental models for pharmacology, epidemiology and ecology. Multiple time scales of a given network are obtained by scaling, based on tropical geometry. Our reduction is mathematically justified within a singular perturbation setting. The existence of invariant manifolds is subject to hyperbolicity conditions, for which we propose an algorithmic test based on Hurwitz criteria. We finally obtain a sequence of nested invariant manifolds and respective reduced systems on those manifolds. Our theoretical results are generally accompanied by rigorous algorithmic descriptions suitable for direct implementation based on existing off-the-shelf software systems, specifically symbolic computation libraries and Satisfiability Modulo Theories solvers. We present computational examples taken from the well-known BioModels database using our own prototypical implementations.
- 8 July 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (3) , 499-534
Open AccessAlgorithmic Reduction of Biological Networks with Multiple Time Scales
We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical reaction networks for cellular biochemistry, and compartmental models for pharmacology, epidemiology and ecology. Multiple time scales of a given network are obtained by scaling, based on tropical geometry. Our reduction is mathematically justified within a singular perturbation setting. The existence of invariant manifolds is subject to hyperbolicity conditions, for which we propose an algorithmic test based on Hurwitz criteria. We finally obtain a sequence of nested invariant manifolds and respective reduced systems on those manifolds. Our theoretical results are generally accompanied by rigorous algorithmic descriptions suitable for direct implementation based on existing off-the-shelf software systems, specifically symbolic computation libraries and Satisfiability Modulo Theories solvers. We present computational examples taken from the well-known BioModels database using our own prototypical implementations.
- Open Access
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.
Open AccessParametric 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.
- Open Access
- 1 June 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (2) , 199-232
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
- 1 June 2021
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 15 (2) , 199-232
Open AccessEfficiently and Effectively Recognizing Toricity of Steady State Varieties