Jesús Montes

Dr. Jesús Montes

orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2011 in Transactions of the American Mathematical Society
Verified
Journal Article
Open access
PDF file
JGJordi Guàrdia
Jordi Guàrdia
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart
We develop a theory of arithmetic Newton polygons of higher order that provides the factorization of a separable polynomial over a p p -adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by Ø. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields.

31 July 2012 in Journal of Algebra and Its Applications
Verified
Journal Article
Closed access
LFLhoussain EL Fadil
Lhoussain EL Fadil
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart

27 November 2011 in Journal de Théorie des Nombres de Bordeaux
Verified
Journal Article
Open access
JGJordi Guàrdia
Jordi Guàrdia
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory requirements of the algorithm appear to be very good.

1 March 1992 in Journal of Algebra
Verified
Journal Article
Closed access
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart

1 February 2015 in Journal of Number Theory
Verified
Journal Article
Closed access
JGJordi Guàrdia
Jordi Guàrdia
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart

4 October 2012 in Foundations of Computational Mathematics
Verified
Journal Article
Open access
PDF file
JGJordi Guàrdia
Jordi Guàrdia
JMJesús Montes
Jesús Montes
ENEnric Nart
Enric Nart
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 the Montes algorithm, which is an extremely fast procedure to construct the prime ideals.