First-Order Tests for Toricity - Archive ouverte HAL Access content directly
Book Sections Year : 2020

First-Order Tests for Toricity


Motivated by problems arising with the symbolic analysis of steady state ideals in Chem-ical Reaction Network Theory, we consider the problem of testing whether the points in acomplex or real variety with non-zero coordinates form a coset of a multiplicative group.That property corresponds to Shifted Toricity, a recent generalization of toricity of the cor-responding polynomial ideal. The key idea is to take a geometric view on varieties ratherthan an algebraic view on ideals. Recently, corresponding coset tests have been proposedfor complex and for real varieties. The former combine numerous techniques from commu-tative algorithmic algebra with Gröbner bases as the central algorithmic tool. The latterare based on interpreted first-order logic in real closed fields with real quantifier eliminationtechniques on the algorithmic side. Here we take a new logic approach to both theories,complex and real, and beyond. Besides alternative algorithms, our approach provides aunified view on theories of fields and helps to understand the relevance and interconnectionof the rich existing literature in the area, which has been focusing on complex numbers,while from a scientific point of view the (positive) real numbers are clearly the relevantdomain in chemical reaction network theory. We apply prototypical implementations ofour new approach to a set of 129 models from the BioModels repository

Dates and versions

hal-02977488 , version 1 (25-10-2020)



Hamid Rahkooy, Thomas Sturm. First-Order Tests for Toricity. Computer Algebra in Scientific Computing: 22nd International Workshop - CASC 2020, 12291, pp.510-527, 2020, LNCS, ⟨10.1007/978-3-030-60026-6_30⟩. ⟨hal-02977488⟩
58 View
0 Download



Gmail Facebook X LinkedIn More