The number of irreducible factors of a polynomial, II

• Autorzy: Christopher G. Pinner , Jeffrey D. Vaaler
• Języki publikacji: EN
• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Acta Arithmetica
• Rocznik: 1996-1997
• Tom: 78
• Numer: 2
• Strony: 125-142

Daty

wydano

1996

otrzymano

1995-12-15

Twórcy

autor

Christopher G. Pinner

• Department of Mathematics, University of British Columbia, Vancouver, British Columbia, V6T 1Z2, Canada
• Centre for Experimental and Constructive Mathematics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6, Canada

autor

Jeffrey D. Vaaler

• Department of Mathematics, The University of Texas at Austin, Austin, Texas 78712-1082, U.S.A.

Bibliografia

• [1] E. Dobrowolski, On a question of Lehmer and the number of irreducible factors of a polynomial, Acta Arith. 34 (1979), 391-401.
• [2] G. Hajós, Solution to problem 41, Mat. Lapok 4 (1953), 40-41 (in Hungarian).
• [3] H. B. Mann, On linear relations between roots of unity, Mathematika 12 (1965), 107-117
• [4] H. L. Montgomery and A. Schinzel, Some arithmetic properties of polynomials in several variables, in: Transcendence Theory: Advances and Applications, Academic Press, 1977, 195-203.
• [5] C. G. Pinner and J. D. Vaaler, The number of irreducible factors of a polynomial, I, Trans. Amer. Math. Soc. 339 (1993), 809-834.
• [6] A. Schinzel, On the number of irreducible factors of a polynomial, II, Ann. Polon. Math. 42 (1983), 309-320.