Alexander Esterov

activity

20062026

most citedElimination theory and Newton polytopes

4 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing math.AGShow all

4 papers · 1 filter

math.AG2025

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…

math.AG2024

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…

math.AG2024

Schön complete intersections

Alexander Esterov

A complete intersection $f_{1} = \dots = f_{k} = 0$ is schön, if $f_{1} = \dots = f_{j} = 0$ defines a schön subvariety of an algebraic torus for every $j ⩽ k$ . This class includes nondegener…

math.AG2006★ 4 cited

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.