A Generalization of Girstmair's Irreducibility Criterion
Jitender Singh, Sanjeev Kumar

TL;DR
This paper extends existing irreducibility criteria for polynomials, providing a broader generalization of Girstmair's and Murty's conditions to identify irreducible polynomials more effectively.
Contribution
The paper introduces a further generalization of Girstmair's and Murty's irreducibility criteria, enhancing their applicability and scope.
Findings
Extended the criteria to broader classes of polynomials
Provided new theoretical conditions for irreducibility
Improved methods for polynomial irreducibility testing
Abstract
Girstmair in [1, Theorem 1] gave a generalization of Murty's irreducibility criterion (see [2, Theorem 1]). In this article, we further generalize these criteria.
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
TopicsMathematics and Applications · Advanced Mathematical Theories
