Benchmarks of small admissible tuples: Difference between revisions
No edit summary |
No edit summary |
||
| Line 70: | Line 70: | ||
|4000 | |4000 | ||
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_4000_36612_2554.txt 36,612] (XFX) | | [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_4000_36612_2554.txt 36,612] (XFX) | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
|- | |||
|- | |||
|3000 | |||
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_3000_26606_-29486.txt 26,606] (XFX) | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
|- | |||
|2000 | |||
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_2000_16978_1108.txt 16,978] (XFX) | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
|- | |||
|1000 | |||
| [http://math.mit.edu/~drew/admissible_1000_7802.txt 7,802] (TJE&AVS) | |||
| - | | - | ||
| - | | - | ||
| Line 95: | Line 132: | ||
== Contributors == | == Contributors == | ||
AVS: Andrew Sutherland | AVS: Andrew V. Sutherland | ||
pedant | pedant | ||
| Line 101: | Line 138: | ||
Scott Morrison | Scott Morrison | ||
TJE: Thomas J Engelsma | TJE: Thomas J. Engelsma | ||
Wouter Castryck | Wouter Castryck | ||
Revision as of 09:30, 20 June 2013
Here is a table to fill in the best upper bounds available for small admissible tuples (1~10000).
Rules
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).
Notes:
- 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.
Records
| [math]\displaystyle{ k_0 }[/math] | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|---|
| 6320 | - | - | - | - | - | - | - | - | - | 60,726 (XFX-AVS) |
| 5500 | - | - | - | - | - | - | - | - | - | - |
| 5540 | - | - | - | 51,526 (AVS) | - | - | - | - | - | - |
| 5000 | 46,810 (XFX) | - | - | - | - | - | - | - | - | - |
| 4000 | 36,612 (XFX) | - | - | - | - | - | - | - | - | - |
| 3000 | 26,606 (XFX) | - | - | - | - | - | - | - | - | - |
| 2000 | 16,978 (XFX) | - | - | - | - | - | - | - | - | - |
| 1000 | 7,802 (TJE&AVS) | - | - | - | - | - | - | - | - | - |
| 340 | - | - | 342 (TJE&AVS) | - | - | - | - | - | - | - |
Contributors
AVS: Andrew V. Sutherland
pedant
Scott Morrison
TJE: Thomas J. Engelsma
Wouter Castryck
XFX: xfxie
ZWS: Zhi-Wei Sun
Yitang Zhang: All work is based on Zhang's breakthrough paper.
