Timeline for Decompose Polynomials
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Mar 12, 2018 at 14:26 | comment | added | alephalpha |
@flawr I'm using the second algorithm in the paper, which always returns integral polynomials when the input is integral. In fact, the divisors function in Pari/GP always returns primitive polynomials when it takes an integral polynomial. It can be proved that if p=q∘r, where p and r are integral, and r is primitive with r(0)=0, then q must also be integral. Here p, q, r correspond to f, g, h in the paper.
|
|
| Mar 12, 2018 at 12:10 | comment | added | flawr | Do you check (or filter out) whether you actually get a decomposition into integral polynomials? (I'm asking because the algorithms in the linked paper describe the factorization over some field, and I don't know any Pari/GP.) | |
| Mar 12, 2018 at 6:31 | history | edited | alephalpha | CC BY-SA 3.0 |
added 34 characters in body
|
| Mar 12, 2018 at 5:41 | history | answered | alephalpha | CC BY-SA 3.0 |