From Polymath Wiki
Revision as of 02:34, 2 March 2009 by Teorth (Talk | contribs)

Jump to: navigation, search
Date General Uniformity Ergodic theory Small n
Jan 26 Nielsen: Doing science online
Jan 27 Gowers: Is massively collaborative mathematics possible?
Jan 28 Kalai: Mathematics, science, and blogs
Jan 30 Gowers: Background to a polymath project

Nielsen: Is massively collaborative mathematics possible?

Feb 1 Gowers: Questions of procedure

Gowers: A combinatorial approach to DHJ (1-199)

Gowers: Why this particular problem?

Tao: A massively collaborative mathematical project

Trevisan: A people's history of mathematics

Solymosi.2: IP-corners problem proposed

Tao.4: Analytic proof of Sperner? Regularisation needed?

Hoang.4: Naive Varnavides for DHJ fails

Gowers.1: Carlson-Simpson theorem useful?

Tao.4: Stationarity useful?

Feb 2 Gowers.9: Reweighting vertices needed for Varnavides?

Tao.17: Should use [math]O(\sqrt{n})[/math] wildcards

Tao.18: Use rich slices?

Gowers.19: Collect obstructions to uniformity!

Kalai.29: Fourier-analytic proof of Sperner?

O'Donnell.32: Use uniform distribution on slices

Gowers.38: Can't fix # wildcards in advance

Tao.39: Can take # wildcards to be O(1)

Bukh.44: Obstructions to Kruskal-Katona?

Tao.8: [math]c_0=1[/math], [math]c_1=2[/math], [math]c_2=6[/math], [math]3^{n-O(\sqrt{n}} \leq c_n \leq o(3^n)[/math]

Kalai.15: [math]c_n \gg 3^n/\sqrt{n}[/math]

Tao.39: [math]c_n \geq 3^{n-O(\sqrt{\log n})}[/math]

Tao.40: [math]c_3=18[/math]

Elsholtz.43: Moser(3)?

Feb 3 Nielsen: The polymath project Gowers.64: Use local equal-slices measure?

Gowers.70: Collection of obstructions to uniformity begins

Tao.86: Use Szemeredi's proof of Roth?

Jakobsen.59: [math]c_4 \geq 49[/math]

Tao.78: [math]c_4 \leq 54[/math]

Neylon.83: [math]52 \leq c_4 \leq 54[/math], [math]140 \leq c_5 \leq 162[/math]

Feb 4 Gowers: Quick question Tao.100: Use density incrementation?

Tao.118: Szemeredi's proof of Roth looks inapplicable

Jakobsen.90: [math]c_4=52[/math]
Feb 5 Tao.130: DHJ(2.5)?

Bukh.132, O'Donnell.133, Solymosi.135: Proof of DHJ(2.5)

Tao.148: Obstructions to uniformity summarised

Tao: Upper and lower bounds for DHJ (200-299)
Feb 6 Solymosi.155 Pair removal for Kneser graphs

Gowers: The triangle removal approach (300-399)

Neylon.201 Greedy algorithm

Tao.206 Use [math]D_n[/math]

Feb 7 Gowers.335 DHJ(j,k) introduced Jakobsen.207 [math]c_5 \geq 150[/math], [math]c_6 \geq 450[/math]

Peake.217 [math]c_7 \geq 1308[/math], [math]c_8 \geq 3780[/math]

Peake.218 Lower bounds up to [math]c_{15}[/math]

Feb 8 Gowers: Quasirandomness and obstructions to uniformity (400-499) Peake.219 [math]c_{99} \geq 3^{98}[/math]

Tao.225 Spreadsheet set up

Feb 9 Nielsen: Update on the polymath project C D Kalai.233 Higher k?
Feb 10 B C D Peake.241 [math]c_5 \leq 155[/math]; xyz notation

Peake.243 [math]c_5 \leq 154[/math]

Feb 11 B C Tao: A reading seminar on DHJ (600-699) Tao.249: [math]\overline{c}^\mu_0 = 1[/math], [math]\overline{c}^\mu_1 = 2[/math], [math]\overline{c}^\mu_2 = 4[/math]

Dyer.254 [math]\overline{c}^\mu_3 = 6[/math]

Feb 12 Wiki set up C D Jakobsen.257 [math]\overline{c}^\mu_4 = 9[/math]

Jakobsen.258 [math]\overline{c}^\mu_5 = 12[/math]

Peake.262 Extremisers for [math]c_4[/math]

Feb 13 B Gowers: Possible proof strategies (500-599) Tao: Bounds for first few DHJ numbers (700-799)
Feb 14 B C D Sauvaget: A proof that [math]c_5=154[/math]?
Feb 15 B C D Sauvaget: A new strategy for computing [math]c_n[/math]
Feb 16 B C D
Feb 17 B C D E
Feb 18 B C D E
Feb 19 B C D E
Feb 20 B C D E
Feb 21 Gowers: To thread or not to thread C D E
Feb 22 B C D E
Feb 23 B Gowers: Brief review of polymath1 (800-849) D E
Feb 24 B C D E
Feb 25 B C D E
Feb 26 B C D E
Feb 27 B C D E
Feb 28 B C D E
Mar 1 B C D E
Mar 2 B Gowers: DHJ 851-899 D E