A study of some recent irreducibility criteria for polynomials having integer coefficients
Sanjeev Kumar, Jitender Singh
TL;DR
This paper reviews recent criteria for determining when polynomials with integer coefficients are irreducible over the rationals, providing insights into algebraic polynomial analysis.
Contribution
It compiles and discusses recent developments in irreducibility criteria for integer polynomials, offering a comprehensive overview of current methods.
Findings
Summarizes recent irreducibility tests
Highlights new algebraic criteria
Provides a comparative analysis of methods
Abstract
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Coding theory and cryptography