On the number of irreducible polynomials with 0,1 coefficients

• Autorzy: S. V. Konyagin
• Języki publikacji: EN

Kategorie tematyczne

• 11C08: Polynomials

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Acta Arithmetica
• Rocznik: 1999
• Tom: 88
• Numer: 4
• Strony: 333-350

Daty

wydano

1999

otrzymano

1997-05-28

poprawiono

1998-11-28

Twórcy

autor

S. V. Konyagin

• Department of Mechanics and Mathematics, Moscow State University, Moscow, 119899, Russia

Bibliografia

• [1] I. Bárány and Z. Füredi, Computing the volume is difficult, Discrete Comput. Geom. 2 (1987), 319-326.
• [2] J. Brillhart, M. Filaseta and A. M. Odlyzko, On an irreducibility theorem of A. Cohn, Canad. J. Math. 33 (1981), 1055-1059.
• [3] E. Dobrowolski, On a question of Lehmer and the number of irreducible factors of a polynomial, Acta Arith. 34 (1979), 391-401.
• [4] M. Filaseta, Irreducibility criteria for polynomials with nonnegative coefficients, Canad. J. Math. 40 (1988), 339-351.
• [5] L. Kronecker, Zwei Sätze über Gleichungen mit ganzzahligen Coefficienten, J. Reine Angew. Math. 53 (1857), 133-175.
• [6] R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, 1983.
• [7] A. M. Odlyzko and B. Poonen, Zeros of polynomials with 0,1 coefficients, Enseign. Math. 39 (1993), 317-348.
• [8] K. Prachar, Primzahlverteilung, Springer, Berlin, 1957.
• [9] V. Tikhomirov, Some Problems of Approximation Theory, Moscow State University, Moscow, 1976 (in Russian).
• [10] E. C. Titchmarsh, The Theory of Functions, 2nd ed., Oxford Univ. Press, 1939.