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

DOI10.4064/aa113-2-5zbMath1049.11027OpenAlexW2067789325MaRDI QIDQ4811248

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

zbMATH Keywords

polynomialsfactorizationHilbert's irreducibility theorem

Mathematics Subject Classification ID

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

Related Items (8)

Irreducibility results for compositions of polynomials with integer coefficients ⋮ Irreducibility criteria for the sum of two relatively prime multivariate polynomials ⋮ A Capelli type theorem for multiplicative convolutions of polynomials ⋮ An irreducibility criterion for the sum of two relatively prime polynomials ⋮ Irreducibility criteria for compositions of polynomials with integer coefficients ⋮ Irreducibility results for compositions of polynomials in several variables ⋮ On the number of factors of convolutions of polynomials with integer coefficients ⋮ IRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS

This page was built for publication: Upper bounds for the number of factors for a class of polynomials with rational coefficients