Abstract
Some concepts, such as divisibility, coprimeness, in the framework of ordinary polynomial product are extended to the framework of conjugate product. Euclidean algorithm for obtaining greatest common divisors in the framework of conjugate product is also established. Some criteria for coprimeness are established. © 2011 Elsevier Ltd. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 735-741 |
| Journal | Applied Mathematics Letters |
| Volume | 24 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - May 2011 |
Research Keywords
- Conjugate product
- Coprimeness
- Euclidean division
- Greatest common divisors
Fingerprint
Dive into the research topics of 'On conjugate product of complex polynomials'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver