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

DOI10.1216/RMJ-2008-38-2-417zbMATH Open1236.11029MaRDI QIDQ1011007FDOQ1011007

Authors: Alexandru Zaharescu, Anca Iuliana Bonciocat, Nicolae Ciprian Bonciocat 

Publication date: 7 April 2009

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

Recommendations

• scientific article; zbMATH DE number 6476583
• Irreducibility results for compositions of polynomials with integer coefficients
• A Capelli type theorem for multiplicative convolutions of polynomials
• Irreducibility results for compositions of polynomials in several variables
• The number of irreducible factors of a polynomial, II

zbMATH Keywords

irreducibilityresultantconvolution of polynomials

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Capelli type theorem for multiplicative convolutions of polynomials
• On a special case of Hilbert's irreducibility theorem
• Title not available (Why is that?)
• Upper bounds for the number of factors for a class of polynomials with rational coefficients

Cited In (5)

• An irreducibility criterion for the sum of two relatively prime polynomials
• Irreducibility criteria for the sum of two relatively prime multivariate polynomials
• Irreducibility criteria for sums of two relatively prime polynomials
• Irreducibility of generalized Fibonacci polynomials
• Irreducibility criteria for compositions of polynomials with integer coefficients

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011007)