Dividing Polynomials Using the Resultant Matrix

DOI10.1080/00927870701658185MaRDI QIDQ5432586zbMATH OpenOpenAlexFDO

Authors Sung Sik Woo

Publication date 17 December 2007

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00927870701658185

zbMATH Keywords

Fitting invariantfree cyclic coderesultant

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Polynomials, factorization in commutative rings (13P05)

Recommendations

• SOME REMARKS ON EISENSTEIN'S CRITERION
• A new approach to polynomials
• Irreducibility of polynomials and Diophantine equations
• A DIVISION ALGORITHM
• Division by non-singular matric polynomials

Cites work

• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 3439001 (Why is no real title available?)
• Quasi-cyclic codes over Z/sub 4/ and some new binary codes

Cited in

(3)

• SOME REMARKS ON EISENSTEIN'S CRITERION
• When does a given polynomial with integer coefficients divide another?
• scientific article; zbMATH DE number 1929310 (Why is no real title available?)

This page was built for publication: Dividing Polynomials Using the Resultant Matrix

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