Pages that link to "Item:Q4811248"

The following pages link to Upper bounds for the number of factors for a class of polynomials with rational coefficients (Q4811248):

Displaying 8 items.

• Irreducibility criteria for compositions of polynomials with integer coefficients (Q515627) (← links)
• Irreducibility results for compositions of polynomials with integer coefficients (Q867144) (← links)
• On the number of factors of convolutions of polynomials with integer coefficients (Q1011007) (← links)
• An irreducibility criterion for the sum of two relatively prime polynomials (Q1744947) (← links)
• Irreducibility criteria for the sum of two relatively prime multivariate polynomials (Q2421715) (← links)
• Irreducibility results for compositions of polynomials in several variables (Q2483770) (← links)
• Irreducibility criteria for sums of two relatively prime polynomials (Q2850706) (← links)
• A Capelli type theorem for multiplicative convolutions of polynomials (Q3530073) (← links)