Implementing the Round Four maximal order algorithm

DOI10.5802/jtnb.105zbMath0817.11064OpenAlexW1982737855MaRDI QIDQ1340675

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

zbMATH Keywords

factorization algorithmmonic separable polynomialexplicit programsintegral \(p\)-adic coefficientsround four algorithm

Mathematics Subject Classification ID

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

Related Items (10)

Computing integral bases via localization and Hensel lifting ⋮ Computation of integral bases ⋮ Efficient computation of maximal orders in Artin-Schreier-Witt extensions ⋮ Polynomial factorization algorithms over number fields ⋮ A fast algorithm for polynomial factorization over \(\mathbb Q_p\) ⋮ Efficient computation of maximal orders in radical (including Kummer) extensions ⋮ Computation of triangular integral bases ⋮ 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.

Uses Software

• Maple

Cites Work

• An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• The construction of maximal orders over a Dedekind domain
• Computational problems, methods, and results in algebraic number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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