Timeline for Software computation with arithmetic schemes
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2014 at 15:42 | answer | added | Jakob Kroeker | timeline score: 2 | |
| Aug 6, 2013 at 17:43 | comment | added | LMN | I find it very strange/hard to believe that there is an algorithm to compute the integral closure (which is generally considered "hard") for interesting rings ($\mathbb{Z}$-algebras above), but that there is no implementation. | |
| Aug 6, 2013 at 17:40 | comment | added | LMN | Thanks Martin, I believe Sage also does Groebner bases over $\mathbb{Z}$ and Magma more generally over Euclidean domains. However, neither does primary decomposition or computes the radical. | |
| S Aug 6, 2013 at 13:16 | history | suggested | user36560 |
Add a tag.....
|
|
| Aug 6, 2013 at 12:33 | review | Suggested edits | |||
| S Aug 6, 2013 at 13:16 | |||||
| Aug 6, 2013 at 7:27 | comment | added | Martin Bright | Magma can do Groebner bases over the integers, and IIRC primary decomposition as well. It will also do Groebner bases over finite truncations of p-adic rings. | |
| Aug 6, 2013 at 3:50 | history | asked | LMN | CC BY-SA 3.0 |