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

DOI10.4064/BC118-15MaRDI QIDQ5226549zbMATHOpenAlexWikidataFDO

Authors Michael Filaseta, Robert F. Murphy, A. F. Vincent

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)

Recommendations

• Computational aspects of irreducible polynomials
• Characterizing polynomial complexity classes by reducibilities
• scientific article; zbMATH DE number 1305288
• Computational experiences on the distances of polynomials to irreducible polynomials
• Irreducibility criteria for reciprocal polynomials and applications
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• On the complexity of the computation of certain classes of polynomials of several variables
• On the Irreducibility of Certain Classes of Polynomials
• Computing the equisingularity type of a pseudo-irreducible polynomial
• scientific article; zbMATH DE number 4070302

Cites work

• scientific article; zbMATH DE number 1305288 (Why is no real title available?)
• scientific article; zbMATH DE number 1467743 (Why is no real title available?)
• An extension of a theorem by Ljunggren
• On the Irreducibility of Certain Trinomials and Quadrinomials.
• On the Irreducibility of the Trinomials $x^n\pm x^m\pm1$.
• On the irreducibility of certain trinomials
• Reducibility of lacunary polynomials XII
• Solution d'un problème de K. Zarankiewicz sur les suites de puissances consécutives de nombres irrationnels
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The factorization of certain quadrinominals.

Cited in

(2)

• The non-cyclotomic part of \(f(x)x^n + g(x)\) and roots of reciprocal polynomials off the unit circle
• Coefficients and higher order derivatives of cyclotomic polynomials: old and new (with an appendix by Pedro García-Sánchez)

This page was built for publication: Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226549)