Algorithmic conjecture for detecting zero-divisor ACR
Algorithmic conjecture for detecting zero-divisor ACR
Let be a mass-action system with species and rational-number rate constants, and let be its steady-state ideal. For each species , Algorithm~ computes a reduced Gröbner basis of using an elimination order for all variables except , and outputs pairs from positive roots of the resulting univariate basis element or of leading coefficients. Zero-divisor ACR detection conjecture. If has zero-divisor ACR in species with ACR-value , then is one of the outputs of the algorithm. This would provide an algebraic procedure for finding ACR species and values even when the relevant factor is a zero-divisor modulo the steady-state ideal; the source does not state a resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Luis David García Puente, Elizabeth Gross, Heather A Harrington, Matthew Johnston, Nicolette Meshkat, Mercedes Pérez Millán and Anne Shiu, “Absolute concentration robustness: Algebra and geometry”, arXiv:2401.00078 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.