The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Solving Systems of Polynomial Equations
Abstract
Abstract. One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory, and numerous other areas. The set of solutions to a system of polynomial equations is an algebraic variety, the basic object of algebraic geometry. The algorithmic study of algebraic varieties is the central theme of computational algebraic geometry. Exciting recent developments in symbolic algebra and numerical software for geometric calculations have revolutionized the field, making formerly inaccessible problems tractable, and providing fertile ground for experimentation and conjecture. The first half of this book furnishes an introduction and represents a snapshot of the state of the art regarding systems of polynomial equations. Afficionados of the well-known text books by Cox, Little, and O’Shea will find familiar themes in the first five chapters: polynomials in one variable, Gröbner
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Commutative algebra with a view toward algebraic geometry
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4552 · Cited by 3,738
Introduction to Toric Varieties.
Fulton, W. (1993) · Cited by 2,778
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5053 · Cited by 2,034
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
Shafarevich, I. R. (1994) · Springer eBooks · doi:10.1007/978-3-642-57956-1 · Cited by 1,651
(2005) · Graduate Texts in Mathematics · doi:10.1007/b138611 · Cited by 1,621
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
Equilibrium Points of Bimatrix Games
Lemke, C. E., & Howson, Jr. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112033 · Cited by 1,231
Numerical Continuation Methods--An Introduction.
Watson, L. T., Allgower, E. L., & Georg, K. (1992) · Mathematics of Computation · doi:10.2307/2153001 · Cited by 991
The Computation of Economic Equilibria.
Binmore, K., Scarf, H. E., & Hansen, T. (1974) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344737 · Cited by 849
Algebraic algorithms for sampling from conditional distributions
Diaconis, P., & Sturmfels, B. (1998) · The Annals of Statistics · doi:10.1214/aos/1030563990 · Cited by 616
Self-citationGraphical Models for Game Theory
Kearns, M. J., Littman, M. L., & Singh, S. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2281 · Cited by 544
Minimizing polynomial functions
Parrilo, P. A., & Sturmfels, B. (2003) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/060/08 · Cited by 316
Self-citation(2000) · Graduate Texts in Mathematics · doi:10.1007/b97680 · Cited by 281
Resultants and Chow forms via exterior syzygies
Eisenbud, D., Schreyer, F., & Weyman, J. (2003) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-03-00423-5 · Cited by 253
Laurent Determinants and Arrangements of Hyperplane Amoebas
Forsberg, M., Passare, M., & Tsikh, A. (2000) · Advances in Mathematics · doi:10.1006/aima.1999.1856 · Cited by 160
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
Sommese, A. J., Verschelde, J., & Wampler, C. W. (2001) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142900372549 · Cited by 140
Reducibility of the families of 0-dimensional schemes on a variety
Iarrobino, A. (1972) · Inventiones mathematicae · doi:10.1007/bf01418644 · Cited by 124
Product formulas for resultants and Chow forms
Pedersen, P. S., & Sturmfels, B. (1993) · Mathematische Zeitschrift · doi:10.1007/bf02572411 · Cited by 115
Self-citationBounds for cell entries in contingency tables given marginal totals and decomposable graphs
Dobra, A., & Fienberg, S. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.22.11885 · Cited by 106
A subdivision-based algorithm for the sparse resultant
Canny, J., & Emiris, I. Z. (2000) · Journal of the ACM · doi:10.1145/337244.337247 · Cited by 101
Constant terms in powers of a Laurent polynomial
Duistermaat, J. J., & van der Kallen, W. (1998) · Indagationes Mathematicae · doi:10.1016/s0019-3577(98)80020-7 · Cited by 71
Cited by
Eigenvalues of a real supersymmetric tensor
Qi, L. (2005) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.05.007 · Cited by 1,440
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Aghassi, M., & Bertsimas, D. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0686-0 · Cited by 333
Tropical geometry and its applications
Mikhalkin, G. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-2/40 · Cited by 317
On equilibrium properties of the replicator–mutator equation in deterministic and random games
Duong, M. H., & Han, T. A. (2020) · Dynamic Games and Applications · doi:10.1007/s13235-019-00338-8 · Cited by 7
Metadata
- Authors
- Sturmfels, B.
- Venue
- CBMS Regional Conference Series in Mathematics
- Publisher
- American Mathematical Society
- Published
- 2002-09-12
- ISSN
- 0160-7642 (ISSN-L)
- 2380-5668
- OpenAlex
- W217710249
- Cited by
- 792
- References
- 23
- FWCI
- 23.16
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.