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

DOI10.1016/S0747-7171(87)80048-2zbMath0624.12001MaRDI QIDQ1092109

R. Böffgen, M. A. Reichert

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

semi-simple algebradecomposition of rational primeFord-Zassenhaus algorithmHensel- Zassenhaus factorizationmonic separable polynomialORDMAXp-adic values

Mathematics Subject Classification ID

PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Quaternion and other division algebras: arithmetic, zeta functions (11R52) Algebras and orders, and their zeta functions (11S45) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (2)

Implementing the Round Four maximal order algorithm ⋮ Polynomial factorization algorithms over number fields

Cites Work

• Unnamed Item
• Unnamed Item
• On Hensel factorization. I
• On structural stability

This page was built for publication: Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)