Square-free OM computation of global integral bases (Q2676955)

Let \(K\) be a number field with defining polynomial \(f(x) \in {\mathbb Z}[x]\). Let \(p\in {\mathbb Z}\) be a prime. Using the OM algorithm developed by \textit{J. Montes} in his Thesis [Higher order Newton polygons and arithmetical applications. Barcelona: University of Barcelona (PhD Thesis) (1999)] it is possible to obtain a \(p\)-integral bases for \(K\). Hence, if one can completely factor the discriminant of \(f\), then one can obtain a global integral basis for \(K\) [the first author et al., Trans. Am. Math. Soc. 364, No. 1, 361--416 (2012; Zbl 1252.11091)]. In the present paper the authors adapt the techniques of the OM algorithm to develop the SF-OM algorithm which works over \({\mathbb Z}/N{\mathbb Z}\) where \(N >1\) is an integer not necessarily a prime. Then, inspired by [the first author et al., J. Number Theory 147, 549--589 (2015; Zbl 1394.11071)], the authors are able to obtain an algorithm which gives a global integral basis for \(K\) even in cases where the complete factorization of the discriminant of \(f\) is not available. In the last section of the paper the authors give some examples to illustrate the flow of the algorithm.