Implementing the Round Four maximal order algorithm

DOI10.5802/JTNB.105MaRDI QIDQ1340675zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 8 August 1995

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_1994__6_1_39_0, https://eudml.org/doc/229586, http://www.emis.de/journals/JTNB/1994-1/jtnb6-1.html

zbMATH Keywords

explicit programsfactorization algorithmintegral \(p\)-adic coefficientsmonic separable polynomialround four algorithm

Mathematics Subject Classification ID

Polynomials (11S05) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 2186836
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• scientific article; zbMATH DE number 3991629
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• Efficient computation of maximal orders in radical (including Kummer) extensions

Cites work

• An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
• Computational problems, methods, and results in algebraic number theory
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3133601 (Why is no real title available?)
• scientific article; zbMATH DE number 3991629 (Why is no real title available?)
• scientific article; zbMATH DE number 52125 (Why is no real title available?)
• scientific article; zbMATH DE number 3526799 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• The construction of maximal orders over a Dedekind domain

Cited in

(14)

• The construction of maximal orders over a Dedekind domain
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Polynomial factorization algorithms over number fields
• Computation of integral bases
• Efficient computation of maximal orders in Artin-Schreier-Witt extensions
• scientific article; zbMATH DE number 2186836 (Why is no real title available?)
• scientific article; zbMATH DE number 3991629 (Why is no real title available?)
• Efficient computation of maximal orders in radical (including Kummer) extensions
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Factoring polynomials over local fields. II
• Factoring polynomials over local fields.
• Computation of triangular integral bases
• Plane curve germs and contact factorization
• Computing integral bases via localization and Hensel lifting

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Implementing the Round Four maximal order algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340675)