1 citations · 1 across the 2 of their papers we have counts for
4 papers
Engineered Complete Intersections: Algorithmic Aspects
Alexander Esterov, Rafael Mohr, Yulia Mukhina
Engineered Complete Intersections (ECI's) are a class of sparse polynomial systems frequently arising in a number of contexts, both in pure mathematics (e.g. enumerative geometry)…
Projecting dynamical systems via a support bound
Yulia Mukhina, Gleb Pogudin
For a polynomial dynamical system, we study the problem of computing the minimal differential equation satisfied by a chosen coordinate (in other words, projecting the system on th…
Support bound for differential elimination in polynomial dynamical systems
Yulia Mukhina, Gleb Pogudin
We study an important special case of the differential elimination problem: given a polynomial parametric dynamical system and…
On the Computation of Newton Polytopes of Eliminants
Rafael Mohr, Yulia Mukhina
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mi…