Implementing the Round Four maximal order algorithm (Q1340675)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Implementing the Round Four maximal order algorithm
scientific article

    Statements

    Implementing the Round Four maximal order algorithm (English)
    0 references
    0 references
    0 references
    8 August 1995
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    round four algorithm
    0 references
    monic separable polynomial
    0 references
    integral \(p\)-adic coefficients
    0 references
    factorization algorithm
    0 references
    explicit programs
    0 references
    0 references
    0 references