arXiv2015
Although Buchberger's algorithm, in theory, allows us to compute Gröbner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(α)$, a simple extension of $\mathbb{Q}$, where $α$ is an algebraic number, and let $f \in \mathbb{Q}[t]$ be the minimal polynomial of $α$. In this paper we present a new efficient method to compute Gröbner bases in polynomial rings over the algebraic number field $K$. Starting from the ideas of Noro [Noro, 2006], we proceed by joining $f$ to the ideal to be considered, adding $t$ as an extra variable. But instead of avoiding superfluous S-pair reductions by inverting algebraic numbers, we achieve the same goal by applying modular methods as in [Arnold, 2003; Böhm et al., 2015; Idrees et al., 2011], that is, by inferring information in characteristic zero from information in characteristic $p > 0$. For suitable primes $p$, the minimal polynomial $f$ is reducible over $\mathbb{F}_p$. This allows us to apply modular methods once again, on a second level, with respect to the factors of $f$. The algorithm thus resembles a divide and conquer strategy and is in particular easily parallelizable. At current state, the algorithm is probabilistic in the sense that, as for other modular Gröbner basis computations, an effective final verification test is only known for homogeneous ideals or for local monomial orderings. The presented timings show that for most examples, our algorithm, which has been implemented in SINGULAR, outperforms other known methods by far.