Discrete Invariants of Generically Inconsistent Systems of Laurent Polynomials
Leonid Monin

TL;DR
This paper extends Newton polyhedron theory to compute discrete invariants of algebraic varieties defined by generically inconsistent systems of Laurent polynomials, incorporating supports and polyhedra into the analysis.
Contribution
It introduces a method to analyze systems that are generically inconsistent, linking supports and Newton polyhedra to invariants of the solution set.
Findings
Computed invariants for consistent systems with fixed supports.
Extended Newton polyhedron theory to inconsistent systems.
Revealed the role of supports in the invariants of algebraic varieties.
Abstract
Let be finite sets in and let be an algebraic variety defined by a system of equations \[ f_1 = \ldots = f_k = 0, \] where are Laurent polynomials with supports in . Assuming that are sufficiently generic, the Newton polyhedron theory computes discrete invariants of in terms of the Newton polyhedra of . It may appear that the generic system with fixed supports is inconsistent. In this paper, we compute discrete invariants of algebraic varieties defined by system of equations which are generic in the set of consistent system with support in by reducing the question to the Newton polyhedra theory. Unlike the classical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Commutative Algebra and Its Applications
