Name
Abstract | ||
|---|---|---|
Let K be a field of characteristic zero and let K‾ be an algebraic closure of K. Consider a sequence of polynomials G=(g1,…,gs) in K[X1,…,Xn] with s<n, a polynomial matrix F=[fi,j]∈K[X1,…,Xn]p×q, with p≤q and n=q−p+s+1, and the algebraic set Vp(F,G) of points in K‾ at which all polynomials in G and all p-minors of F vanish. Such polynomial systems appear naturally in polynomial optimization or computational geometry. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jsc.2020.09.008 | Journal of Symbolic Computation |
Keywords | Field | DocType |
Polynomial system solving,Homotopy,Symbolic computation,Determinantal algebraic sets,Complexity | Polynomial optimization,Discrete mathematics,Combinatorics,Algebraic closure,Polynomial,Polynomial matrix,Computational geometry,Homotopy,Algebraic set,Maxima,Mathematics | Journal |
Volume | ISSN | Citations |
104 | 0747-7171 | 0 |
PageRank | References | Authors |
0.34 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan D. Hauenstein | 1 | 269 | 37.65 |
| Mohab Safey El Din | 2 | 450 | 35.64 |
| Éric Schost | 3 | 712 | 58.00 |
| Thi Xuan Vu | 4 | 0 | 0.34 |