Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts

DOI10.4064/bc118-15zbMath1419.11141OpenAlexW2963225557WikidataQ127454271 ScholiaQ127454271MaRDI QIDQ5226549

Andrew F. Vincent, Robert F. Murphy, Michael Filaseta

Publication date: 31 July 2019

Published in: Banach Center Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/bc118-15

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Factorization (11Y05)

Related Items

Coefficients and higher order derivatives of cyclotomic polynomials: old and new (with an appendix by Pedro García-Sánchez)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the irreducibility of certain trinomials
• On the Irreducibility of Certain Trinomials and Quadrinomials.
• On the Irreducibility of the Trinomials $x^n\pm x^m\pm1$.
• Solution d'un problème de K. Zarankiewicz sur les suites de puissances consécutives de nombres irrationnels
• An extension of a theorem by Ljunggren
• Reducibility of lacunary polynomials XII
• The factorization of certain quadrinominals.