Benchmarks of small admissible tuples

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)	-	-	-	-	-	-	-	-	-
340	-	-	342 (TJE&AVS)	-	-	-	-	-	-	-

Contributors

AVS: Andrew 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.