A new computational approach to ideal theory in number fields
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/28201
Tipus de documentArticle
Data publicació2013
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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 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
CitacióGuàrdia, J.; Montes, J.; Nart, E. A new computational approach to ideal theory in number fields. "Foundations of computational mathematics", 2013, vol. 13, núm. 5, p. 729-762.
ISSN1615-3375
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Ideals.pdf | 496,4Kb | Visualitza/Obre |