A parametric \(\mathrm{F}_4\) algorithm (Q6571583)

In this paper, the authors present a parametric \(F_{4}\) algorithm (so called \(PF_{4}\)) which can be considered as a generalization of Faugere's \(F_{4}\) algorithm [\textit{J.-C. Faugère}, J. Pure Appl. Algebra 139, No. 1--3, 61--88 (1999; Zbl 0930.68174)] to polynomial ideals with parametric coefficients. The authors approach is based on the \(F_{4}\) algorithm, Montes DisPGB algorithm [\textit{A. Montes}, J. Symb. Comput. 33, No. 2, 183--208 (2002; Zbl 1068.13016)] and the parametric linear algebra method developed in [\textit{M. Dehghani Darmian} and \textit{A. Hashemi}, J. Symb. Comput. 82, 38--56 (2017; Zbl 1359.13030)]. The \(PF_{4}\) algorithm takes as input a parametric polynomial ideal and two monomial orderings on the variables and the parameters and returns a Grobner system of the ideal with respect to a compatible elimination product of the given monomial orderings. We have implemented our new algorithm in Maple and give timings to compare its performance with those of (our implementation) of the Kapur et al. algorithm [\textit{D. Kapur} et al., ISSAC 2010, 29--36 (2010; Zbl 1321.68533)] and the DisPGB algorithm [\textit{A. Montes}, J. Symb. Comput. 33, No. 2, 183--208 (2002; Zbl 1068.13016)].