Upper bounds for the number of factors for a class of polynomials with rational coefficients

DOI10.4064/AA113-2-5zbMATH Open1049.11027OpenAlexW2067789325MaRDI QIDQ4811248FDOQ4811248

Authors: Nicolae Ciprian Bonciocat 

Publication date: 18 August 2004

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: http://journals.impan.gov.pl/aa/Inf/113-2-5.html

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\)

zbMATH Keywords

factorizationpolynomialsHilbert's irreducibility theorem

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Hilbertian fields; Hilbert's irreducibility theorem (12E25)

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)