165
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Schönemann–Eisenstein–Dumas-Type Irreducibility Conditions that Use Arbitrarily Many Prime Numbers

Pages 3102-3122 | Received 03 Feb 2014, Published online: 04 Jun 2015

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (3)

Weilin Zhang & Pingzhi Yuan. (2023) On two conjectures of irreducible polynomials. Communications in Algebra 51:11, pages 4879-4884.
Read now
Anuj Jakhar. (2018) On a mild generalization of the Schönemann - Eisenstein - Dumas irreducibility criterion. Communications in Algebra 46:1, pages 114-118.
Read now
Anuj Jakhar & Neeraj Sangwan. (2017) On a mild generalization of the Schönemann irreducibility criterion. Communications in Algebra 45:4, pages 1757-1759.
Read now

Articles from other publishers (3)

Christopher Davis, JungHwan Park & Arunima Ray. (2021) Linear independence of cables in the knot concordance group. Transactions of the American Mathematical Society 374:6, pages 4449-4479.
Crossref
D. Ştefănescu. (2020) Computational Aspects of Irreducible Polynomials. Computational Mathematics and Mathematical Physics 60:1, pages 128-133.
Crossref
Anca Iuliana Bonciocat & Nicolae Ciprian Bonciocat. (2019) Irreducibility Criteria for the Sum of Two Relatively Prime Multivariate Polynomials. Results in Mathematics 74:1.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.