Systems of equations with a single solution
From MaRDI portal
Publication:480678
DOI10.1016/j.jsc.2014.09.007zbMath1314.52011arXiv1211.6763OpenAlexW1990510764MaRDI QIDQ480678
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6763
classificationmixed volumepolynomial-time algorithmpolynomial equationsNewton polyhedrasearch for solutions
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Solving polynomial systems; resultants (13P15)
Related Items
Multivariate Abel-Ruffini ⋮ Overdetermined systems of equations on toric, spherical, and other algebraic varieties ⋮ Effective Poset Inequalities ⋮ INEQUALITIES BETWEEN MIXED VOLUMES OF CONVEX BODIES: VOLUME BOUNDS FOR THE MINKOWSKI SUM ⋮ On defectivity of families of full-dimensional point configurations ⋮ Classification of triples of lattice polytopes with a given mixed volume ⋮ Galois theory for general systems of polynomial equations ⋮ Polyhedra of small relative mixed volume ⋮ Families of lattice polytopes of mixed degree one ⋮ The mixed degree of families of lattice polytopes ⋮ Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products ⋮ Criteria for strict monotonicity of the mixed volume of convex polytopes
Cites Work
- Mixed discriminants
- Counting solutions to binomial complete intersections
- Newton polyhedra of discriminants of projections
- Elimination theory and Newton polytopes
- The number of roots of a system of equations
- Newton polyhedra and the genus of complete intersections
- On the Newton polytope of the resultant
- Mixed fibre polytopes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Determinantal singularities and Newton polyhedra
- Submodular functions and optimization.
- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics
