On the number of factors of convolutions of polynomials with integer coefficients

DOI10.1216/RMJ-2008-38-2-417zbMath1236.11029MaRDI QIDQ1011007

Alexandru Zaharescu, Nicolae Ciprian Bonciocat, Anca Iuliana Bonciocat

Publication date: 7 April 2009

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

irreducibilityresultantconvolution of polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials (irreducibility, etc.) (11R09)

Related Items (5)

Irreducibility criteria for the sum of two relatively prime multivariate polynomials ⋮ Irreducibility of generalized Fibonacci polynomials ⋮ An irreducibility criterion for the sum of two relatively prime polynomials ⋮ Irreducibility criteria for compositions of polynomials with integer coefficients ⋮ IRREDUCIBILITY CRITERIA FOR SUMS OF TWO RELATIVELY PRIME POLYNOMIALS

Cites Work

• On a special case of Hilbert's irreducibility theorem
• A Capelli type theorem for multiplicative convolutions of polynomials
• Upper bounds for the number of factors for a class of polynomials with rational coefficients
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of factors of convolutions of polynomials with integer coefficients