Difference between revisions of "Benchmarks of small admissible tuples"
|Line 65:||Line 65:|
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_5446_51456_2452.txt 51,456] (XFX)
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_5447_51462_-53908.txt 51,462] (XFX&AVS)
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_5448_51472_-53918.txt 51472] (XFX&AVS)
Revision as of 11:04, 20 June 2013
Here is a table to fill in the best upper bounds available for small admissible tuples (1~5500) and a few of others.
Efforts to fill in the blank fields in this table are very welcome. Here are the rules for the "Lucky Winner" game:
- "Winner" for each cell: You might enter each cell with a new tuple with the best upper bound and the abbreviation of your name (Your might append others' if your solution is obtained using others' work. It is encouraged to have a long chain to show the collaborative work.)
- "Lucky": Your cell will be "bold" if it is picked by an angel, if you are sufficiently lucky. The result will be qualified for showing in the main page. Your cell might be stroked through if the luck is not sustained (i.e., if the k0 claim is retracted).
- Thomas J Engelsma have calculated upper bounds exactly for k0 up to 342, but he did not provide his tuples. So your contribution will be shown as TJE&<Your Name>, if your provide an optimal tuple.
|5450||51,498 (XFX)||51,516 (XFX)||51,520 (AVS)||51,526 (AVS)||51,534 (XFX)||51,540 (XFX&AVS)||-||-||-||-||-|
|5440||-||-||-||-||-||-||51,456 (XFX)||51,462 (XFX&AVS)||51472 (XFX&AVS)||-|
AVS: Andrew V. Sutherland
TJE: Thomas J. Engelsma
ZWS: Zhi-Wei Sun
Yitang Zhang: All work is based on Zhang's breakthrough paper.