Timeline for algorithm for calculating the Chow groups of a variety over a finite field
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2011 at 12:51 | comment | added | Dror Speiser | Hey, have you had any luck with this question? | |
| Jan 23, 2010 at 18:15 | history | edited | user19475 | CC BY-SA 2.5 |
added 105 characters in body
|
| Jan 20, 2010 at 22:02 | comment | added | David E Speyer | Fair enough. As you say, the right statement is that there is an algorithm which is conjectured to always terminate and, when it terminates, it computes Pic of an elliptic curve over Q. | |
| Jan 20, 2010 at 18:30 | history | edited | Pete L. Clark |
edited tags
|
|
| Jan 10, 2010 at 20:52 | comment | added | Kevin Buzzard | @David: there is an algorithm for computing Pic of an elliptic curve over Q. We just haven't proved it terminates yet! :-) | |
| Jan 10, 2010 at 20:08 | comment | added | David E Speyer | @Kevin: A^1 is isomorphic to Pic. Since there is no known algorithm for computing Pic of an elliptic curve over Q, there can't be a known algorithm for computing Chow groups over Q either. | |
| Jan 10, 2010 at 17:21 | comment | added | Kevin H. Lin | Are there any algorithms for varieties over, say, C or Q? | |
| Jan 10, 2010 at 17:03 | answer | added | Hailong Dao | timeline score: 6 | |
| Jan 10, 2010 at 16:07 | history | asked | user19475 | CC BY-SA 2.5 |