On the termination of the general XL algorithm and ordinary multinomials
| Autor: | Gary McGuire, Daniela O'Hara |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Algebra and Number Theory
Degree (graph theory) 010102 general mathematics Multivariate polynomials 010103 numerical & computational mathematics 01 natural sciences Overdetermined system Computational Mathematics Quadratic equation 0101 mathematics Focus (optics) Value (mathematics) Algorithm Mathematics |
| Zdroj: | Journal of Symbolic Computation. 104:90-104 |
| ISSN: | 0747-7171 |
| DOI: | 10.1016/j.jsc.2020.04.007 |
| Popis: | The XL algorithm is an algorithm for solving overdetermined systems of multivariate polynomial equations, which was initially introduced for quadratic equations. However, the algorithm works for polynomials of any degree, and in this paper we will focus on the performance of XL for polynomials of degree ≥3, where the optimal termination value of the parameter D is still unknown. We prove that the XL algorithm terminates at a certain value of D in the case that the number of equations exceeds the number of variables by 1 or 2. We also give strong evidence that this value is best possible, and we show that this value is smaller than the degree of regularity. Part of our analysis requires proving that ordinary multinomials are strongly unimodal, and this result may be of independent interest. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect