Is every polynomial with integer coefficients near an irreducible polynomial?

DOI10.4171/EM/255zbMath1321.11035OpenAlexW2063792486MaRDI QIDQ2515078

Michael Filaseta

Publication date: 10 February 2015

Published in: Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?vol=69&iss=3&issn=0013-6018&rank=3

zbMATH Keywords

irreducible polynomialsTurán's problem

Mathematics Subject Classification ID

Polynomials in number theory (11C08)

Related Items (3)

On an application of the $abc$-theorem for polynomials to the squarefree neighbour problem ⋮ The distance to square-free polynomials ⋮ The distance to a squarefree polynomial over $\mathbb F_2[x$]

This page was built for publication: Is every polynomial with integer coefficients near an irreducible polynomial?