A Generalized Criterion for Signature Related Gr\"obner Basis Algorithms
Yao Sun, Dingkang Wang

TL;DR
This paper introduces a unified generalized criterion for signature related Gr"obner basis algorithms, enabling the validation and development of new criteria with broad applicability and theoretical correctness.
Contribution
It proposes a generalized criterion based on partial orders that encompasses existing algorithms and provides a framework for creating new, correct criteria.
Findings
The generalized criterion can specialize to most existing signature related criteria.
The correctness proof applies to non-homogeneous polynomial systems.
Existing criteria partial orders are shown to be admissible.
Abstract
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm, the extended F5 algorithm and the GVW algorithm. The main purpose of current paper is to study in theory what kind of criteria is correct in signature related algorithms and provide a generalized method to develop new criteria. For this purpose, a generalized criterion is proposed. The generalized criterion only relies on a general partial order defined on a set of polynomials. When specializing the partial order to appropriate specific orders, the generalized criterion can specialize to almost all existing criteria of signature related algorithms. For {\em admissible} partial orders, a complete proof of the correctness of the algorithm based on this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Cryptography and Residue Arithmetic · Advanced Numerical Analysis Techniques
