A useful irreducibility result for integer polynomials
From MaRDI portal
Publication:4972088
DOI10.1080/00029890.2019.1655334zbMATH Open1442.12001OpenAlexW2989752068WikidataQ126767159 ScholiaQ126767159MaRDI QIDQ4972088FDOQ4972088
Authors: Anuj Jakhar
Publication date: 22 November 2019
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00029890.2019.1655334
Recommendations
Cites Work
Cited In (12)
- Irreducibility results for compositions of polynomials with integer coefficients
- A family of tests for irreducibility of polynomials
- A NOTE ON GIRSTMAIR’S IRREDUCIBILITY CRITERION
- Irreducibility of integer-valued polynomials in several variables
- Title not available (Why is that?)
- Another irreducibility criterion
- Title not available (Why is that?)
- On an Irreducibility Criterion of M. Ram Murty
- Upper bounds for the number of factors for a class of polynomials with rational coefficients
- An irreducibility criterion for integer polynomials
- Irreducibility of Hurwitz polynomials over the ring of integers
- Further irreducibility criteria for polynomials with non-negative coefficients
This page was built for publication: A useful irreducibility result for integer polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972088)