Timeline for Two (probably) equal real numbers which are not proved to be equal?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2019 at 15:34 | comment | added | Kevin Buzzard | The "min" annoys me a bit in this example, for some reason I can't quite explain. | |
| May 9, 2019 at 1:14 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| May 8, 2019 at 10:58 | comment | added | Jason Rute | @KevinBuzzard Yes, $n=7$. I’ve made it explicit now. | |
| May 8, 2019 at 10:54 | history | edited | Jason Rute | CC BY-SA 4.0 |
Some terms were the distance instead of the reciprocals.; added 1 character in body; edited body
|
| May 8, 2019 at 8:31 | comment | added | Kevin Buzzard | Just to be clear -- the n on the left hand side of the equation in this answer is 7, right? | |
| May 8, 2019 at 8:31 | comment | added | Kevin Buzzard | An open conjecture in arithmetic geometry is whether any group scheme of order n is killed by n. This is true for n=1 and n prime (the latter a theorem of Deligne) but the n=4 case is still open. The n=4 case is simply the question "here is a completely explicit polynomial ring over the integers in about 20 variables -- is this explicit element in this explicit ideal?". Groebner basis methods are apparently not up to this yet. | |
| May 8, 2019 at 3:11 | comment | added | Robert Israel | After breaking the symmetry (by fixing one electron and the direction to another that is not antipodal), the set of critical points is the intersection of some algebraic surfaces and is almost certainly provably finite using Groebner basis methods, although the computations may be too difficult to be practical. | |
| May 7, 2019 at 23:47 | history | answered | Jason Rute | CC BY-SA 4.0 |