Difference between revisions of "Benchmarks of small admissible tuples"

From Polymath1Wiki
Jump to: navigation, search
(Rules)
(Replacing page with 'This is an obsolete page.')
 
(21 intermediate revisions by the same user not shown)
Line 1: Line 1:
Here is a table to fill in the best upper bounds available for small admissible tuples (342~5500).
+
This is an obsolete page.
 
+
 
+
== 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. 
+
 
+
- "Lucky": Your cell will be "bold" if it is picked by an angel, if you are sufficiently lucky. Your cell might be stroked through if the luck is lost (the k0 claim is retracted).
+
 
+
== Records ==
+
 
+
{| border=1
+
|-
+
!<math>k_0</math> !! 0 !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 !! 9
+
|-
+
| 6320
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| [http://www.cs.cmu.edu/~xfxie/project/admissible/admissible_6329_60726_14.txt '''60,726'''] (XFX-AVS)
+
|-
+
| 5500
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
| -
+
|-
+
|5540
+
| -
+
| -
+
| -
+
| [http://math.mit.edu/~drew/admissible_5453_51526.txt '''51,526'''] (AVS)
+
| -
+
| -
+
| -
+
| -
+
| -
+
|-
+
|3400
+
| -
+
| -
+
| -
+
| -
+
| -
+
| <strike>[http://math.mit.edu/~drew/admissible_3405_30600.txt '''30,600'''] (AVS)</strike>
+
| -
+
| -
+
| -
+
|}
+
 
+
== Contributors ==
+
 
+
AVS: Andrew Sutherland
+
 
+
pedant
+
 
+
Scott Morrison
+
 
+
Wouter Castryck
+
 
+
XFX: xfxie
+
 
+
ZWS: Zhi-Wei Sun
+
 
+
'''[http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Yitang Zhang]'''
+

Latest revision as of 17:30, 20 June 2013

This is an obsolete page.