Implementing the Round Four maximal order algorithm (Q1340675): Difference between revisions

Let \(p\) be a prime and let \(f\) be a monic separable polynomial with integral \(p\)-adic coefficients. The authors describe in detail the so- called ``round four algorithm'' to compute the maximal order of the algebras \(\mathbb{Q}_ p [X]/ (f)\). The method combines the usual Dedekind criterion with decompositions of the algebra by means of orthogonal idempotents. The algorithm can be used as an efficient factorization algorithm of the polynomial \(f\). The authors give several examples and explicit programs.