168 research outputs found
Genetics of polynomials over local fields
Let be a discrete valued field with valuation ring \oo, and let
\oo_v be the completion of \oo with respect to the -adic topology. In
this paper we discuss the advantages of manipulating polynomials in \oo_v[x]
in a computer by means of OM representations of prime (monic and irreducible)
polynomials. An OM representation supports discrete data characterizing the
Okutsu equivalence class of the prime polynomial. These discrete parameters are
a kind of DNA sequence common to all individuals in the same Okutsu class, and
they contain relevant arithmetic information about the polynomial and the
extension of that it determines.Comment: revised according to suggestions by a refere
On the Torelli problem and Jacobian Nullwerte in genus three
We give a closed formula for recovering a non-hyperelliptic genus three curve from its period matrix, and derive some identities between Jacobian Nullwerte in dimension three
A new computational approach to ideal theory in number fields
Let be the number field determined by a monic irreducible polynomial with integer coefficients. In previous papers we parameterized the prime ideals of in terms of certain invariants attached to Newton polygons of higher order of the defining equation . In this paper we show how to carry out the basic operations on fractional ideals of in terms of these constructive representations of the prime ideals. From a computational perspective, these results facilitate the manipulation of fractional ideals of avoiding two heavy tasks: the construction of the maximal order of and the factorization of the discriminant of . The main computational ingredient is Montes algorithm, which is an extremely fast procedure to construct the prime ideals
Square-free OM computation of global integral bases
© 2022 Mathematical Sciences PublishersFor a prime p, the OM algorithm finds the p-adic factorization of an irreducible polynomial f¿Z[x]¿¿Z[¿] in polynomial time. This may be applied to construct p-integral bases in the number field K defined by f. In this paper, we adapt the OM techniques to work with a positive integer N instead of p. As an application, we obtain an algorithm to compute global integral bases in K, which does not require a previous factorization of the discriminant of f.Partially supported by grants MTM2015-66180-R and MTM2016-75980-P from the Spanish MECPeer ReviewedPostprint (author's final draft
Single-factor lifting and factorization of polynomials over local fields
Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of f (x), with strong arithmetic properties. In this paper, we develop an algorithm to improve any one of these approximations, till a prescribed precision is attained. The most natural application of this ââsingle-factor liftingââ routine is to combine it with the Montes algorithm to provide a fast polynomial factorization algorithm. Moreover, the single-factor lifting algorithm may be applied as well to accelerate the computational resolution of several global arithmetic problems in which the improvement of an approximation to a single local irreducible factor of a polynomial is requiredPostprint (published version
- âŠ