Upper bounds for the number of factors for a class of polynomials with rational coefficients
From MaRDI portal
(Redirected from Publication:4811248)
Recommendations
- scientific article; zbMATH DE number 1963403
- Irreducibility criteria for sums of two relatively prime polynomials
- An irreducibility criterion for the sum of two relatively prime polynomials
- On a special case of Hilbert's irreducibility theorem
- Irreducibility criteria for sums of two relatively prime multivariate polynomials
- Criteria for the irreducibility of polynomials.
- A useful irreducibility result for integer polynomials
- Is every polynomial with integer coefficients near an irreducible polynomial?
- Irregularities in the Distribution of Irreducible Polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
Cited in
(10)- Irreducibility results for compositions of polynomials with integer coefficients
- On the number of factors of convolutions of polynomials with integer coefficients
- Irreducibility results for compositions of polynomials in several variables
- An irreducibility criterion for the sum of two relatively prime polynomials
- An effective analytic formula for the number of distinct irreducible factors of a polynomial
- A Capelli type theorem for multiplicative convolutions of polynomials
- Irreducibility criteria for the sum of two relatively prime multivariate polynomials
- Irreducibility criteria for sums of two relatively prime polynomials
- Sum of degrees of irreducible factors for polynomials in several variables
- Irreducibility criteria for compositions of polynomials with integer coefficients
This page was built for publication: Upper bounds for the number of factors for a class of polynomials with rational coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4811248)
