Timeline for Computation of a minimal polynomial
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 5, 2017 at 12:10 | comment | added | Dima Pasechnik | math.stackexchange.com/a/155153/39797 is a good general point of view. | |
| Sep 4, 2017 at 16:22 | answer | added | jjcale | timeline score: 3 | |
| S Sep 4, 2017 at 11:16 | history | suggested | Ilmari Karonen | CC BY-SA 3.0 |
wrap Wolfram Alpha query in a block quote, add direct link
|
| Sep 4, 2017 at 10:59 | review | Suggested edits | |||
| S Sep 4, 2017 at 11:16 | |||||
| Sep 4, 2017 at 7:50 | answer | added | Peter Taylor | timeline score: 4 | |
| Sep 3, 2017 at 18:59 | answer | added | Moritz Firsching | timeline score: 14 | |
| Sep 3, 2017 at 18:52 | answer | added | Max Alekseyev | timeline score: 9 | |
| Sep 3, 2017 at 18:40 | answer | added | jjcale | timeline score: 3 | |
| Sep 3, 2017 at 18:29 | comment | added | Gro-Tsen | Sage has a field "QQbar" for exact algebraic numbers, you can take the roots of your original polynomials over that field (e.g., change ring and factor), then perform whatever computations you need, and use the ".minpoly" method to get the minimal polynomial. | |
| Sep 3, 2017 at 16:34 | vote | accept | Anton | ||
| Sep 3, 2017 at 16:13 | answer | added | Igor Rivin | timeline score: 10 | |
| Sep 3, 2017 at 15:55 | history | asked | Anton | CC BY-SA 3.0 |