3 citations · 3 across the 5 of their papers we have counts for
6 papers
On a factorization result of Ştefănescu -- II
Sanjeev Kumar, Jitender Singh
Ştefănescu proved an elegant factorization result for polynomials over discrete valuation domains [CASC'2014, Lecture Notes in Computer Science, Ed. by V. Gerdt, W. Koepf, W. Mayr,…
Another irreducibility criterion
Jitender Singh, Sanjeev Kumar
Let be a primitive polynomial. Suppose that there exists a positive real number such that $|a_m| α^m>|a_0|+|a_1|α+\cdots+|a_{m-1}|α…
On a factorization result of Ştefănescu
Sanjeev Kumar, Jitender Singh
In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial…
A Generalization of Girstmair's Irreducibility Criterion
Jitender Singh, Sanjeev Kumar
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.
A New Class of Irreducible Polynomials
Jitender Singh, Sanjeev Kumar
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the comple…
On an Irreducibility Criterion of Anca I. Bonciocat and Nicolae C. Bonciocat
Sanjeev Kumar, Jitender Singh
There is an error in the main result. We provide an easy generalization to the irreducibility criterion in the title.