The construction of maximal orders over a Dedekind domain

DOI10.1016/S0747-7171(87)80054-8zbMath0632.13003MaRDI QIDQ1095198

David J. Ford

Publication date: 1987

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

zbMATH Keywords

polynomialDedekind domainmaximal order

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05) Separable algebras (e.g., quaternion algebras, Azumaya algebras, etc.) (16H05)

Related Items (11)

Implementing the Round Four maximal order algorithm ⋮ Polynomial factorization algorithms over number fields ⋮ A polynomial reduction algorithm ⋮ Single-factor lifting and factorization of polynomials over local fields ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Higher Newton polygons and integral bases ⋮ Computing local integral closures ⋮ Factoring polynomials over local fields. ⋮ Normalization of rings ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings ⋮ On the Computation of the Class Number of an Algebraic Number Field

Cites Work

• On structural stability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The construction of maximal orders over a Dedekind domain