Timeline for What algorithm in algebraic geometry should I work on implementing?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2010 at 4:49 | comment | added | Junkie | Doesn't SAGE just out-source most algebraic geometry to SINGULAR or Macaulay2? I personally would say that polyhedral homotopy continuation (PHoM, PHCPack, HOM4PS, Bertini) is the place to go, though it seems that the automotive industry (robotics) has been the leader in implementing much of it. | |
| Mar 17, 2010 at 14:19 | comment | added | Charles Siegel | Another thing to look at might be contributing to Macaulay 2 ( math.uiuc.edu/Macaulay2 ) which is the go-to computation package for many algebraic geometers I know. | |
| Mar 17, 2010 at 13:14 | comment | added | Steven Gubkin | @Jacques Ya, if only they supported Haskell... | |
| Mar 17, 2010 at 13:13 | vote | accept | Steven Gubkin | ||
| Mar 17, 2010 at 13:13 | comment | added | Steven Gubkin | Now this is very cool! I love the idea of a high level open source mathematics program - I always thought a proof which was Mathematica assisted was slightly suspect because you can't check the code for errors. I am all for making high level mathematics more available to the public. So I think I have found where I should devote my energy. Thanks!!! | |
| Mar 17, 2010 at 13:10 | comment | added | Jacques Carette | The only downside to going that route is that you'll then be forced into (a dialect of) Python or C as the programming languages. Which is like forcing a category theorist to make the choice between working in either an untyped HOL or 'raw' ZFC. | |
| Mar 17, 2010 at 1:21 | history | answered | Jon Yard | CC BY-SA 2.5 |