Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers
From MaRDI portal
Publication:5501049
Abstract: The famous irreducibility criteria of Sch"onemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of Sch"onemann-Eisenstein-Dumas-type for polynomials with integer coefficients, criteria that are given by some divisibility conditions for their coefficients with respect to arbitrarily many prime numbers. A special attention will be paid to those irreducibility criteria that require information on the divisibility of the coefficients by two distinct prime numbers.
Recommendations
- On a mild generalization of the Schönemann-Eisenstein-Dumas irreducibility criterion
- A generalization of Eisenstein-Schönemann's irreducibility criterion
- A simple generalization of the Schönemann-Eisenstein irreducibility criterion
- Eisenstein-Dumas criterion for irreducibility of polynomials and projective transformations of the independent variable
- On the factors of a polynomial
Cites work
- A generalization of Eisenstein-Schönemann irreducibility criterion
- A mild generalization of Eisenstein's criterion
- Algebraic Properties of a Family of Generalized Laguerre Polynomials
- Laguerre polynomials with Galois group \(A_m\) for each \(m\)
- On Eisenstein-Dumas and generalized Schönemann polynomials
- On a certain family of generalized Laguerre polynomials
- On a generalization of Eisenstein's irreducibility criterion
- On the Galois group of generalized Laguerre polynomials
- On the irreducibility of a certain class of Laguerre polynomials
- On the irreducibility of the generalized Laguerre polynomials
- Ramification polygons, splitting fields, and Galois groups of Eisenstein polynomials
- Some \(\widetilde A_ n\)-extensions obtained from generalized Laguerre polynomials
- Specializations of one-parameter families of polynomials
- The irreducibility of all but finitely many Bessel polynomials
- Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First
Cited in
(12)- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
- On a mild generalization of the Schönemann irreducibility criterion
- On the number of polynomials of bounded height that satisfy the Dumas criterion
- Irreducibility criteria for the sum of two relatively prime multivariate polynomials
- On the irreducible factors of a polynomial
- On two conjectures of irreducible polynomials
- Eisenstein Irreducibility Criterion for Modules
- Linear independence of cables in the knot concordance group
- On a mild generalization of the Schönemann-Eisenstein-Dumas irreducibility criterion
- Eisenstein-Dumas criterion for irreducibility of polynomials and projective transformations of the independent variable
- Computational aspects of irreducible polynomials
- Revisiting Eisenstein-type criterion over integers
This page was built for publication: Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501049)