A new computational approach to ideal theory in number fields

Details A new computational approach to ideal theory in number fields A new computational approach to ideal theory in number fields

2010-05-07

arxiv.org/abs/1005.1156v3

Mathematics

Number Theory

Scientific paper

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher order of the defining equation $f(x)$. In this paper we show how to carry out the basic operations on fractional ideals of $K$ in terms of these constructive representations of the prime ideals. From a computational perspective, these results facilitate the manipulation of fractional ideals of $K$ avoiding two heavy tasks: the construction of the maximal order of $K$ and the factorization of the discriminant of $f(x)$. The main computational ingredient is Montes algorithm, which is an extremely fast procedure to construct the prime ideals.

Affiliated with

Also associated with

No associations

Rating

A new computational approach to ideal theory in number fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new computational approach to ideal theory in number fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new computational approach to ideal theory in number fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222439