Abstract
In this paper, we give a new proof using Newton polygons for an irreducibility criterion established by Singh and Kumar. Then we prove a conjecture of Koley and Reddy. In addition, we give a new proof for the statement that with is irreducible unless , which is a conjecture of Harrington.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
