New bounds for the support of input-output equations in differential-algebraic systems

Gabriela Jeronimo; Leonardo Lanciano

Home/Archive/arXiv

arXiv · 2609.03828

New bounds for the support of input-output equations in differential-algebraic systems

Gabriela Jeronimo·Leonardo Lanciano

View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a polynomial dynamical system $\mathbf{x}'=\mathbf{f}(\mathbf{x},\mathbf{u})$ together with an observation function $y=g(\mathbf{x},\mathbf{u})$, where $\mathbf{x}=(x_1,\ldots,x_n)$, $\mathbf{u}=(u_1,\ldots,u_m)$ and $y$ are differential variables, and $\mathbf{f}=(f_1,\ldots,f_n)$, $g$ are polynomials with coefficients in a differential field, we study the problem of determining a minimal polynomial differential equation satisfied by the inputs $\mathbf{u}$ and the output $y$ which follows as a differential consequence of the system. We provide a characterization of a finite superset of the set of monomials appearing with non-zero coefficients in this input-output equation. Specifically, we establish an upper bound for the degree of the minimal polynomial and a family of inequalities that define a polytope containing its Newton polytope. These results extend recent work by Mukhina and Pogudin for systems with constant parameters, and enable the use of evaluation-interpolation techniques for the efficient computation of such eliminant polynomials.

Explore related subjects

math.AG cs.SC

Keep this discovery

BibTeX RIS

Gabriela Jeronimo, Leonardo Lanciano. 2026-09-03. New bounds for the support of input-output equations in differential-algebraic systems. https://arxiv.org/abs/2609.03828

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.SC subject math.AG subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Deciding superellipticity and computing the Weierstrass normal form

Let $ \mathcal{S}_{g,n} \subset \mathcal{M}_g $ be the locus of curves of genus $ g \geq 2 $ admitting a model $ y^n = h(x) $ with $ h $ separable; such curves $C$ have a cyclic group $ C_n \leq \operatorname{Aut}(C) $ of order $ n $ with $ C/C_n \cong \mathbb{P}^1 $. % We give an algorithm which, given an absolutely irreducible plane model $ F(x,y) = 0 $ of a curve $ C $ over a field $ k_0 $ of characteristic zero, decides for which $ n $ the curve lies in $ \mathcal{S}_{g,n} $ and returns a model $ y^n = h(x) $ together with the birational transformation to it.

math.AG↗

arXiv2026

Learning Fast Monomial Orders for Gröbner Basis Computations

The efficiency of Gröbner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on static heuristics such as GrevLex, guided primarily by expert intuition. We address this gap by casting the selection of monomial orderings as a reinforcement learning problem over the space of admissible orderings. Our approach leverages domain-informed reward signals that accurately reflect the computational cost of Gröbner basis computations and admits efficient Monte Carlo estimation. Experiments on benchmark problems from systems biology and computer vision show that the resulting learned policies consistently outperform standard heuristics, yielding substantial reductions in computational cost. Moreover, we find that these policies resist distillation into simple interpretable models, providing empirical evidence that deep reinforcement learning allows the agents to exploit non-linear geometric structure beyond the scope of traditional heuristics.

cs.SC↗

arXiv2026

Degree bounds and synchronization in Gröbner basis computations for affine semi-regular systems

Determining the complexity of computing Gröbner bases is an important problem in both theory and practice, and solving degrees provide a central measure of this complexity. We study solving degrees and Gröbner basis computations for affine polynomial systems, with particular emphasis on semi-regular sequences. We first derive two upper bounds for the maximum Gröbner basis degree of the homogenized system. One is based on a regular initial subsequence of the highest-degree homogeneous parts. When these parts form a semi-regular sequence in nondecreasing degree order, the bound involves the $n$ smallest input degrees together with the largest one. The other bound is expressed in terms of the saturation exponent with respect to the homogenizing variable. Both are obtained by bounding the degree from which the Hilbert function of the quotient ring associated with the homogenized system is constant. We then compare the Buchberger-like Gröbner basis computations for an affine system, its homogenization, and its highest-degree homogeneous parts. The first degree fall is characterized by failure of injectivity of multiplication by the homogenizing variable. Before that point, choices of S-pairs and reducers in any computation can be matched in the others, and reduction sequences, remainders, intermediate bases, and leading monomials correspond under specialization. Cryptographic semi-regularity guarantees this correspondence until the step degree first reaches the degree of regularity. At that degree, affine reduction steps that preserve the sugar degree lift to homogeneous ones, yielding upper bounds on the algorithmic solving degree for a computation starting directly from the affine input.

math.AC↗