English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Efficiently and Effectively Recognizing Toricity of Steady State Varieties

Grigoriev, D., Iosif, A., Rahkooy, H., Sturm, T., & Weber, A. (2019). Efficiently and Effectively Recognizing Toricity of Steady State Varieties. Retrieved from http://arxiv.org/abs/1910.04100.

Item is

Files

show Files
hide Files
:
arXiv:1910.04100.pdf (Preprint), 714KB
Name:
arXiv:1910.04100.pdf
Description:
File downloaded from arXiv at 2020-01-23 12:24
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Grigoriev, Dima1, Author
Iosif, Alexandru1, Author
Rahkooy, Hamid1, Author
Sturm, Thomas2, Author           
Weber, Andreas1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: Quantitative Biology, Molecular Networks, q-bio.MN,Computer Science, Symbolic Computation, cs.SC,Mathematics, Algebraic Geometry, math.AG
 Abstract: We consider the problem of testing whether the points in a complex or real
variety with non-zero coordinates form a multiplicative group or, more
generally, a coset of a multiplicative group. For the coset case, we study the
notion of shifted toric varieties which generalizes the notion of toric
varieties. This requires a geometric view on the varieties rather than an
algebraic view on the ideals. We present algorithms and computations on 129
models from the BioModels repository testing for group and coset structures
over both the complex numbers and the real numbers. Our methods over the
complex numbers are based on Gr\"obner basis techniques and binomiality tests.
Over the real numbers we use first-order characterizations and employ real
quantifier elimination. In combination with suitable prime decompositions and
restrictions to subspaces it turns out that almost all models show coset
structure. Beyond our practical computations, we give upper bounds on the
asymptotic worst-case complexity of the corresponding problems by proposing
single exponential algorithms that test complex or real varieties for toricity
or shifted toricity. In the positive case, these algorithms produce generating
binomials. In addition, we propose an asymptotically fast algorithm for testing
membership in a binomial variety over the algebraic closure of the rational
numbers.

Details

show
hide
Language(s): eng - English
 Dates: 2019-10-092019
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 1910.04100
URI: http://arxiv.org/abs/1910.04100
BibTex Citekey: Grigoriev_arXiv1910.04100
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show