A correct proof of the heuristic GCD algorithm
Bernard Parisse
TL;DR
This paper provides a complete proof of the heuristic GCD algorithm for multivariate polynomials, addressing previous gaps and enhancing understanding of the method.
Contribution
It offers the first rigorous proof of the heuristic GCD algorithm in the multivariate case, clarifying its correctness.
Findings
Confirmed the correctness of the heuristic GCD algorithm for multivariate polynomials
Filled a gap in the existing proof by Char, Geddes, and Gonnet
Provided additional insights into the method's properties
Abstract
In this note, we fill a gap in the proof of the heuristic GCD in the multivariate case made by Char, Geddes and Gonnet (JSC 1989) and give some additionnal information on this method.
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
TopicsAdvanced Combinatorial Mathematics · Polynomial and algebraic computation · Advanced Mathematical Identities