An inequality about factors of polynomials-Reference-Cited by-同舟云学术

An inequality about factors of polynomials

Published:1974 Issue:128 Volume:28 Page:1153-1157
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Mignotte M.

Abstract

A sharp inequality is proved about the product of some roots of a polynomial. It is used to bound the height of the factors of a polynomial. Applications are given to the problem of factorization and numerical examples show that these bounds strongly improve the previous ones.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1974-28-128/S0025-5718-1974-0354624-3/S0025-5718-1974-0354624-3.pdf

Reference4 articles.

1. An application of Jensen’s formula to polynomials;Mahler, K.;Mathematika,1960

2. Critères d’irréductibilité de polynômes sur un corps de nombres;Mignotte, Maurice;Enseign. Math. (2),1972

3. On Hensel factorization. I;Zassenhaus, Hans;J. Number Theory,1969

4. Lecture Notes in Mathematics, Vol. 262;Zimmer, Horst G.,1972

Cited by 90 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. L’algorithmique de la théorie algébrique des nombres;Journées mathématiques X-UPS;2024-08-06

2. New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

3. Approximating the chromatic polynomial is as hard as computing it exactly;computational complexity;2024-01-18

4. On the separation of the roots of the generalized Fibonacci polynomial;Indagationes Mathematicae;2023-12

5. New Algorithms for Solving Zero-Sum Stochastic Games;Mathematics of Operations Research;2021-02