vix.ing · top · new · best · stats

Discrete Invariants of Generically Inconsistent Systems of Laurent Polynomials

2017/03/19 by Leonid Monin, Monin, Leonid
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #math.AG #math.CO

paper · pdf · doi:10.48550/arxiv.1703.06392

10 pages, subsection 4.1 is added, comments are welcome

openalex publication_date 2017/03/19 · arxiv created 2018/09/29 · arxiv updated 2018/10/02 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28

Abstract

Let A1, …, Ak be finite sets in ℤn and let Y ⊂ (ℂ^*)n be an algebraic variety defined by a system of equations f1 = … = fk = 0, where f1, …, fk are Laurent polynomials with supports in A1, …, Ak. Assuming that f1, …, fk are sufficiently generic, the Newton polyhedron theory computes discrete invariants of Y in terms of the Newton polyhedra of f1, …, fk . It may appear that the generic system with fixed supports A1, …, Ak 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 A1, …, Ak by reducing the question to the Newton polyhedra theory. Unlike the classical situation, not only the Newton polyhedra of f1,…,fk, but also the supports A1, …, Ak themselves appear in the answers.

Related