A polyhedral method for solving sparse polynomial systems
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
A continuation method is presented for computing all isolated roots of a semimixed sparse system of polynomial equations. We introduce mixed subdivisions of Newton polytopes, and we apply them to give a new proof and algorithm for Bernstein’s theorem on the expected number of roots. This results in a numerical homotopy with the optimal number of paths to be followed. In this homotopy there is one starting system for each cell of the mixed subdivision, and the roots of these starting systems are obtained by an easy combinatorial construction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to Toric Varieties.
Fulton, W. (1993) · Cited by 2,778
Discriminants, Resultants, and Multidimensional Determinants
Gelfand, I. M., Kapranov, M. M., & Zelevinsky, A. V. (1994) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4771-1 · Cited by 2,306
Shafarevich, I. R. (1994) · Springer eBooks · doi:10.1007/978-3-642-57956-1 · Cited by 1,651
Introduction to Toric Varieties. (AM-131)
Fulton, W. (1993) · Princeton University Press eBooks · doi:10.1515/9781400882526 · Cited by 1,402
Numerical Continuation Methods
Allgower, E. L., & Georg, K. (1990) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61257-2 · Cited by 1,269
Walker, R. J. (1950) · Cited by 1,240
A homotopy for solving general polynomial systems that respects m-homogeneous structures
Morgan, A., & Sommese, A. (1987) · Applied Mathematics and Computation · doi:10.1016/0096-3003(87)90063-4 · Cited by 202
Product formulas for resultants and Chow forms
Pedersen, P. S., & Sturmfels, B. (1993) · Mathematische Zeitschrift · doi:10.1007/bf02572411 · Cited by 115
Self-citationChow polytopes and general resultants
Kapranov, M. M., Sturmfels, B., & Zelevinsky, A. V. (1992) · Duke Mathematical Journal · doi:10.1215/s0012-7094-92-06707-x · Cited by 111
Self-citationOn The Complexity of Computing Mixed Volumes
Dyer, M., Gritzmann, P., & Hufnagel, A. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794278384 · Cited by 80
Metadata
- Authors
- Huber, B., & Sturmfels, B.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1995
- Volume
- 64
- Issue
- 212
- Pages
- 1541-1555
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W1989923040
- Cited by
- 330
- References
- 11
- FWCI
- 14.79
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A polyhedral method for solving sparse polynomial systems. https://app.cochat.ai/papers/10.1090/s0025-5718-1995-1297471-4
- The paper
- Huber, B., & Sturmfels, B. (1995). A polyhedral method for solving sparse polynomial systems. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1995-1297471-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.