A combinatorial formula is proven for the mixed volume of semi-interlaced polytopes, including those arising in algebraic degree computations via Kouchnirenko-Bernshtein theory.
Esterov, Engineered complete intersections: slightly degenerate Bernstein--Kouchnirenko–-Khovanskii, (2024), arXiv:2401.12099v1 https://arxiv.org/abs/2401.12099v1
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.
citing papers explorer
-
Semi-interlaced polytopes
A combinatorial formula is proven for the mixed volume of semi-interlaced polytopes, including those arising in algebraic degree computations via Kouchnirenko-Bernshtein theory.
-
Projecting dynamical systems via a support bound
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.