Benchmarks of small admissible tuples: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
Xfxie (talk | contribs)
Xfxie (talk | contribs)
Replacing page with 'This is an obsolete page.'
 
(24 intermediate revisions by the same user not shown)
Line 1: Line 1:
Here is a table to fill in the best upper bounds 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.
 
== 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
 
[http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Yitang Zhang]

Latest revision as of 16:30, 20 June 2013

This is an obsolete page.