4 citations · 4 across the 5 of their papers we have counts for
5 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)…
Engineered complete intersections: eliminating variables and understanding topology
Alexander Esterov
We continue the study of engineered complete intersections (ECI) -- an umbrella generality for a number of important objects in combinatoiral and applied algebraic geometry (such a…
Engineered complete intersections: slightly degenerate Bernstein--Kouchnirenko--Khovanskii
Alexander Esterov
Geometry of sparse systems of polynomial equations (i.e. the ones with prescribed monomials and generic coefficients) is well studied in terms of their Newton polytopes. The result…
Schön complete intersections
Alexander Esterov
A complete intersection is schön, if defines a schön subvariety of an algebraic torus for every . This class includes nondegener…
Elimination theory and Newton polytopes
Askold Khovanskii, Alexander Esterov
We study elimination theory in the context of Newton polytopes and develop its convex-geometric counterpart.