Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\) (Q1092109)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
scientific article

    Statements

    Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\) (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Let f be a monic separable polynomial over the rational integers \({\mathbb{Z}}\) and p be a rational prime. We set up an algorithm which yields the extended p-adic values of a given element \(\alpha\) in the semi-simple algebra \(A_ f={\mathbb{Q}}[X]/f\). Firstly, we determine the decomposition of p in \(A_ f\) and an approximate factorization of f over the p-adic completion \({\mathbb{Q}}_ p\) by means of the ORDMAX algorithm of Ford- Zassenhaus. Then it is an easy matter to calculate the values of \(\alpha\). In case it would be necessary to improve the factorization, we thirdly give a modification of the Hensel-Zassenhaus factorization method which works even if the factors are not relatively prime modulo p. Finally, some examples are given at the end of the paper.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    decomposition of rational prime
    0 references
    Ford-Zassenhaus algorithm
    0 references
    monic separable polynomial
    0 references
    p-adic values
    0 references
    semi-simple algebra
    0 references
    ORDMAX
    0 references
    Hensel- Zassenhaus factorization
    0 references
    0 references
    0 references