Geodesic
On the number of terms in the irreducible factors of a polynomial over Q
Glasgow mathematical journal, Tome 34 (1992) no. 1, pp. 11-15

Voir la notice de l'article provenant de la source Cambridge University Press

All polynomials considered in this paper belong to Q[x] and reducibility means reducibility over Q. It has been established by one of us [5] that every binomial in Q[x] has an irreducible factor which is either a binomial or a trinomial. He has further raised the question “Does there exist an absolute constant K such that every trinomial in Q[x] has a factor irreducible over Q which has at most K terms (i.e. K non-zero coefficients)?” 
Choudhry, A.; Schinzel, A. On the number of terms in the irreducible factors of a polynomial over Q. Glasgow mathematical journal, Tome 34 (1992) no. 1, pp. 11-15. doi: 10.1017/S001708950000848X
@article{10_1017_S001708950000848X,
     author = {Choudhry, A. and Schinzel, A.},
     title = {On the number of terms in the irreducible factors of a polynomial over {Q}},
     journal = {Glasgow mathematical journal},
     pages = {11--15},
     year = {1992},
     volume = {34},
     number = {1},
     doi = {10.1017/S001708950000848X},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S001708950000848X/}
}
TY  - JOUR
AU  - Choudhry, A.
AU  - Schinzel, A.
TI  - On the number of terms in the irreducible factors of a polynomial over Q
JO  - Glasgow mathematical journal
PY  - 1992
SP  - 11
EP  - 15
VL  - 34
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S001708950000848X/
DO  - 10.1017/S001708950000848X
ID  - 10_1017_S001708950000848X
ER  - 
%0 Journal Article
%A Choudhry, A.
%A Schinzel, A.
%T On the number of terms in the irreducible factors of a polynomial over Q
%J Glasgow mathematical journal
%D 1992
%P 11-15
%V 34
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S001708950000848X/
%R 10.1017/S001708950000848X
%F 10_1017_S001708950000848X

[1] 1.Bremner, A., On reducibility of trinomials, Glasgow Math. J. 22 (1981), 155–156. Google Scholar | DOI

[2] 2.Dorwart, H. L., Irreducibility of polynomials, Amer. Math. Monthly 42 (1935), 369–381. Google Scholar | DOI

[3] 3.Dumas, G., Sur quelques cas d'irréductibilité des polynômes à coefficients rationels, Journal Math, pures appl (2) 6 (1906) 191–258. Google Scholar

[4] 4.Hilbert, D., Über die Irreduzibilität ganzer rationaler Funktionen mit ganzzahligen Koeffizienten, Ges. Abh. Bd II 264–286. Google Scholar | DOI

[5] 5.Schinzel, A., Some unsolved problems in polynomials, Matematicka biblioteka, 25 (1963) 63–70. Google Scholar

[6] 6.Schinzel, A., Selected Topics on Polynomials, (The University of Michgan Press, 1982). Google Scholar | DOI

[7] 7.Verdenius, W., On the number of terms of the square and the cube of polynomials, Indag. Math. 11 (1949) 459–465. Google Scholar

Cité par Sources :