2024/11/22 by Elisenda Feliu, Feliu, Elisenda, Oskar Henriksson +1 · 1 citation
Computer Science · Engineering · Physics and Astronomy · #14A10 #14A25 #14M25 #14P10 #14Q30 #Algebraic Geometry (math.AG) #Complex Network Analysis Techniques #FOS: Mathematics #Slime Mold and Myxomycetes Research #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2411.15134
openalex publication_date 2024/11/22 · openalex created_date 2024/12/04 · openalex updated_date 2026/07/28
We consider the problem of deciding whether the solution sets of a parametrized polynomial system are toric in the sense that they admit a monomial parametrization. We focus on vertically parametrized systems, which are sparse systems where we allow linear dependencies between coefficients in front of the same monomial. We give a matroid-theoretic characterization of the maximal-dimensional torus for which all solution sets are invariant under componentwise multiplication. Building on this, we provide necessary conditions and sufficient conditions for when the solution sets are unions of finitely many or a unique coset of this torus. The motivation of this work comes from the theory of reaction networks, where toric structure of the steady state system substantially simplifies the determination of multistationarity; here, we show that this is also the case for absolute concentration robustness and steady state invariants.