On the termination of the general XL algorithm and ordinary multinomials

DOI10.1016/J.JSC.2020.04.007zbMATH Open1455.68287arXiv1801.04165OpenAlexW3017936885MaRDI QIDQ2229702FDOQ2229702

Authors: Gary McGuire, Daniela O'Hara 

Publication date: 18 February 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: 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 $geq3$, 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.

Full work available at URL: https://arxiv.org/abs/1801.04165

Recommendations

• The XL-Algorithm and a Conjecture from Commutative Algebra
• All in the XL Family: Theory and Practice
• Information Security and Privacy
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• On the Number of Linearly Independent Equations Generated by XL

zbMATH Keywords

multinomialunimodalordinary multinomialsXL algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Cites Work

• Title not available (Why is that?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Title not available (Why is that?)
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Title not available (Why is that?)
• An application of algebraic geometry to encryption: tame transformation method
• Title not available (Why is that?)
• Title not available (Why is that?)
• An inequality for Hilbert series of graded algebras.
• Operating degrees for XL vs. \(F_{4}/F_{5}\) for generic \(\mathcal{M}Q\) with number of equations linear in that of variables
• The XL-Algorithm and a Conjecture from Commutative Algebra
• Comparison Between XL and Gröbner Basis Algorithms
• Solving degree and degree of regularity for polynomial systems over a finite field
• All in the XL Family: Theory and Practice
• Determining the mode for convolution powers of discrete uniform distribution

This page was built for publication: On the termination of the general XL algorithm and ordinary multinomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229702)