# A New Computational Approach to Ideal Theory in Number Fields

```@article{Gurdia2013ANC,
title={A New Computational Approach to Ideal Theory in Number Fields},
author={Jordi Gu{\`a}rdia and Jes{\'u}s Montes and Enric Nart},
journal={Foundations of Computational Mathematics},
year={2013},
volume={13},
pages={729-762}
}```
• Published 7 May 2010
• Mathematics
• Foundations of Computational Mathematics
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…
Computation of triangular integral bases
• Mathematics
The Open Book Series
• 2019
Let A be a Dedekind domain, K the fraction field of A, and f ∈ A[x] a monic irreducible separable polynomial. For a given non-zero prime ideal p of A we present in this paper a new algorithm to
Single-factor lifting and factorization of polynomials over local fields
• Mathematics, Computer Science
J. Symb. Comput.
• 2012
Contemporary Mathematics Genetics of polynomials over local fields
• Mathematics
• 2014
Let (K, v) be a discrete valued field with valuation ring O, and let Ov be the completion of O with respect to the v-adic topology. In this paper we discuss the advantages of manipulating polynomials
Local computation of differents and discriminants
• E. Nart
• Mathematics
Math. Comput.
• 2014
Routes to compute the p-adic valuation of the discriminant Disc(f), and the resultant Res(f,g), for polynomials f(x),g(x) 2 A(x, where A is a Dedekind domain and p is a non-zero prime ideal of A with finite residue field are deduced.
Square-free OM computation of global integral bases
• Mathematics, Computer Science
• 2022
An algorithm is obtained to compute global integral bases in K, which does not require a previous factorization of the discriminant of f .
Computing with quadratic forms over number fields
• Mathematics, Computer Science
J. Symb. Comput.
• 2018
Genetics of polynomials over local fields
• Mathematics
• 2013
Let \$(K,v)\$ be a discrete valued field with valuation ring \$\oo\$, and let \$\oo_v\$ be the completion of \$\oo\$ with respect to the \$v\$-adic topology. In this paper we discuss the advantages of
A NOTE ON THE MONOGENEITY OF POWER MAPS
• Mathematics
Let φ(x) = xd − t ∈ Z[x] be an irreducible polynomial of degree d ≥ 2, and let θ be a root of φ. The purpose of this paper is to establish necessary and sufficient conditions for φ(x) to be

## References

SHOWING 1-10 OF 40 REFERENCES
Single-factor lifting and factorization of polynomials over local fields
• Mathematics, Computer Science
J. Symb. Comput.
• 2012
Local computation of differents and discriminants
• E. Nart
• Mathematics
Math. Comput.
• 2014
Routes to compute the p-adic valuation of the discriminant Disc(f), and the resultant Res(f,g), for polynomials f(x),g(x) 2 A(x, where A is a Dedekind domain and p is a non-zero prime ideal of A with finite residue field are deduced.
Newton polygons of higher order in algebraic number theory
• Mathematics, Computer Science
• 2008
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a p-adic eld, together with relevant arithmetic information about the
Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Computer Science, Mathematics
• 2008
The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order that computes the p-valuation of the discriminant and the factorization of p in a number field of degree 1000 in a few seconds, in a personal computer.
Okutsu invariants and Newton polygons
• Mathematics
• 2009
Let K be a local field of characteristic zero, O its ring of integers and F(x) a monic irreducible polynomial with coefficients in O. K. Okutsu attached to F(x) certain primitive divisor polynomials
On the Complexity of the Montes Ideal Factorization Algorithm
• Mathematics
ANTS
• 2010
A refined analysis is given that yields an improved estimate of O(nΦ3 + e δΦ + nΦ2 + e Â£2 + £1) bit operations for termination in the worst case of the complete Montes algorithm.
Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings
• Mathematics, Computer Science
ANTS
• 2010
Invited papers.- Putting the Hodge and Tate Conjectures to the Test.- Curves of Genus 3 with a Group of Automorphisms Isomorphic to S3.- Learning with Errors over Rings.- Lattices and Spherical
Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics
• F. Hess
• Mathematics
J. Symb. Comput.
• 2002
We develop a simple and efficient algorithm to compute Riemann---Roch spaces of divisors in general algebraic function fields which does not use the Brill-Noether method of adjoints or any series
A construction for absolute values in polynomial rings
||b + c|| < max (||b||, ||c||) then the value l|b|| is called non-archimedean (Ostrowski [17], p. 272). The thus delimited non-archimedean values are of considerable arithmetic interest. They are