Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

On factor refinement in number fields


Authors: Johannes Buchmann and Friedrich Eisenbrand
Journal: Math. Comp. 68 (1999), 345-350
MSC (1991): Primary 11Y40, 11R27, 11R04, 11Y16
MathSciNet review: 1613766
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $\mathcal O$ be an order of an algebraic number field. It was shown by Ge that given a factorization of an $\mathcal O$-ideal $\mathfrak{a}$ into a product of $\mathcal O$-ideals it is possible to compute in polynomial time an overorder $\mathcal O'$ of $\mathcal O$ and a gcd-free refinement of the input factorization; i.e., a factorization of $\mathfrak{a}\mathcal O'$ into a power product of $\mathcal O'$-ideals such that the bases of that power product are all invertible and pairwise coprime and the extensions of the factors of the input factorization are products of the bases of the output factorization. In this paper we prove that the order $\mathcal O'$ is the smallest overorder of $\mathcal O$ in which such a gcd-free refinement of the input factorization exists. We also introduce a partial ordering on the gcd-free factorizations and prove that the factorization which is computed by Ge's algorithm is the smallest gcd-free refinement of the input factorization with respect to this partial ordering.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation of the American Mathematical Society with MSC (1991): 11Y40, 11R27, 11R04, 11Y16

Retrieve articles in all journals with MSC (1991): 11Y40, 11R27, 11R04, 11Y16


Additional Information

Johannes Buchmann
Affiliation: Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283 Darmstadt, Germany
Email: buchmann@cdc.informatik.th-darmstadt.de

Friedrich Eisenbrand
Affiliation: Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany
Email: eisen@mpi-sb.mpg.de

DOI: http://dx.doi.org/10.1090/S0025-5718-99-01023-6
PII: S 0025-5718(99)01023-6
Received by editor(s): November 21, 1996
Article copyright: © Copyright 1999 American Mathematical Society