Some Extensions and Applications of the Eisenstein Irreducibility Criterion

Bishnoi, Anuj; Khanduja, Sudesh K.

doi:10.1007/978-1-4419-6211-9_10

Search citation statements

Order By: Relevance

Paper Sections

Select...

With These Notations Condition (B) Reads1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2014

Publication Types

Select...

Book2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this case we have s(m − m 1 ) − a(d − d 1 ) = 1, which in view of (1) shows that sm 1 = ad 1 , and since a and s are coprime, we see now that d 1 must be divisible by s.…”

Section: With These Notations Condition (B) Readsmentioning

confidence: 84%

See 1 more Smart Citation

On the Factorization of Polynomials Over Discrete Valuation Domains

Stefanescu

2014

Analele Universitatii "Ovidius" Constanta - Seria Matematica

View full text Add to dashboard Cite

show abstract

“…In this case we have s(m − m 1 ) − a(d − d 1 ) = 1, which in view of (1) shows that sm 1 = ad 1 , and since a and s are coprime, we see now that d 1 must be divisible by s.…”

Section: With These Notations Condition (B) Readsmentioning

confidence: 84%

“…There are many recent results that provide irreducibility conditions for various classes of polynomials by using techniques coming from valuation theory (see for instance [23], [24], [2], [3], [4], [8], [5] and [9]), or Newton polygon method (see for instance [12], [13], [14], [15], [16], [17], [18], [1], [6], [7], [22] and [25]). …”

Section: Introductionmentioning

confidence: 99%