Sparse systems with high local multiplicity

Abstract Consider a sparse system of Laurent polynomials in variables with complex coefficients and support in a finite lattice set . The maximal number of isolated roots of the system in the torus is known to be the normalized volume of the convex hull of (the BKK bound). We explore the following question: if the cardinality of equals , what is the maximum local intersection multiplicity at one point in the torus in terms of and ? This study was initiated by Gabrielov [13] in the multivariate case. We give an upper bound that is always sharp when and, under a technical hypothesis, it is considerably smaller than the previous upper bound for any dimension and codimension . We also present, for any value of and , a particular sparse system with high local multiplicity with exponents in the vertices of a cyclic polytope and we explain the rationale of our choice. Our work raises several interesting questions.

Authors

Institutions

Publication Details

Journal
Journal of the London Mathematical Society
Published
2025-03-01
DOI
https://doi.org/10.1112/jlms.70106
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sparse systems with high local multiplicity

Frédéric Bihan, Alicia Dickenstein, Jens Forsgård
Journal of the London Mathematical Society
Polynomial and algebraic computation
article

Sparse systems with high local multiplicity

Frédéric Bihan, Alicia Dickenstein, Jens Forsgård
article en

Abstract

Abstract Consider a sparse system of Laurent polynomials in variables with complex coefficients and support in a finite lattice set . The maximal number of isolated roots of the system in the torus is known to be the normalized volume of the convex hull of (the BKK bound). We explore the following question: if the cardinality of equals , what is the maximum local intersection multiplicity at one point in the torus in terms of and ? This study was initiated by Gabrielov [13] in the multivariate case. We give an upper bound that is always sharp when and, under a technical hypothesis, it is considerably smaller than the previous upper bound for any dimension and codimension . We also present, for any value of and , a particular sparse system with high local multiplicity with exponents in the vertices of a cyclic polytope and we explain the rationale of our choice. Our work raises several interesting questions.

Journal of the London Mathematical SocietyVol. 111(3)
Consejo Nacional de Investigaciones Científicas y Técnicas (AR), Universidad de Buenos Aires (AR), Laboratoire de Mathématiques Blaise Pascal (FR), Université Savoie Mont Blanc (FR)
Consejo Nacional de Investigaciones Científicas y Técnicas
Openalex Percentile: Top 94%
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.