Single-factor lifting and factorization of polynomials over local fields

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 figures

Scientific paper

Let $f(x)$ be a separable polynomial over a local field. 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 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 required.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Single-factor lifting and factorization of polynomials over local 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 Single-factor lifting and factorization of polynomials over local fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single-factor lifting and factorization of polynomials over local fields will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-346456

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.