Pith. sign in

REVIEW 2 cited by

Engineered complete intersections: slightly degenerate Bernstein--Kouchnirenko--Khovanskii

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.12099 v1 pith:653VBTQ7 submitted 2024-01-22 math.AG

classification math.AG
keywords equationsbernstein--kouchnirenko--khovanskiisystemsclasscoefficientscompletegenericintersections
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 results of this study are colloquially known as the Bernstein--Kouchnirenko--Khovanskii toolkit, and unfortunately are not applicable to many important systems, whose coefficients slightly fail to be generic. This for instance happens if some of the equations are obtained from another one by taking partial derivatives or permuting the variables, or the equations are linear, realizing a non-trivial matroid, or in more advanced settings such as generalized Calabi--Yau complete intersections. Such interesting examples (as well as many others) turn out to belong to a natural class of ``systems of equations that are nondegenerate upon cancellations''. We extend to this class several classical and folklore results of the Bernstein--Kouchnirenko--Khovanskii toolkit, such as the ones regarding the number and regularity of solutions, their irreducibility, tropicalization and Calabi--Yau-ness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Maximum Likelihood Degree of Toric Models is Monotonic

    math.AG 2025-07 accept novelty 8.0 of 10

    The ML degree is monotone with respect to faces of the defining polytope for scaled toric models, settling a conjecture of Coons and Sullivant.

  2. Vector-valued Laurent polynomial equations, toric vector bundles and matroids

    math.AG 2025-07 conditional novelty 7.0 of 10

    A vector-valued BKK theorem: generic zeros of a torus-invariant vector-valued Laurent polynomial are counted by the mixed volume of virtual polytopes delta_i - delta_{i-1}, and the associated mixed volumes satisfy an ...

Pith tools