Algorithmic conjecture for detecting zero-divisor ACR

Let (G,κ)(G,\kappa^*) be a mass-action system with nn species and rational-number rate constants, and let II be its steady-state ideal. For each species XiX_i, Algorithm~ computes a reduced Gröbner basis of II using an elimination order for all variables except xix_i, and outputs pairs (Xi,α)(X_i,\alpha) from positive roots of the resulting univariate basis element or of leading coefficients. Zero-divisor ACR detection conjecture. If (G,κ)(G,\kappa^*) has zero-divisor ACR in species XiX_i with ACR-value α\alpha, then (Xi,α)(X_i,\alpha) 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.