Oldest pages

From Polymath1Wiki
Jump to: navigation, search

Showing below up to 250 results in range #1 to #250.

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

  1. Szemerédi's combinatorial proof of Roth's theorem‏‎ (09:51, 14 February 2009)
  2. Triangle removal lemma‏‎ (16:46, 14 February 2009)
  3. Szemerédi's original proof of Szemerédi's theorem‏‎ (10:35, 15 February 2009)
  4. Kruskal-Katona theorem‏‎ (16:11, 15 February 2009)
  5. Ergodic perspective‏‎ (19:16, 15 February 2009)
  6. Carlson's theorem‏‎ (00:51, 16 February 2009)
  7. Carlson-Simpson theorem‏‎ (00:52, 16 February 2009)
  8. Stirling's formula‏‎ (10:25, 16 February 2009)
  9. Concentration of measure‏‎ (10:30, 16 February 2009)
  10. Graham-Rothschild theorem‏‎ (16:00, 16 February 2009)
  11. Combinatorial subspace‏‎ (16:16, 16 February 2009)
  12. Szemerédi's regularity lemma‏‎ (16:58, 16 February 2009)
  13. Unsolved problems‏‎ (05:50, 17 February 2009)
  14. DHJ(1,3)‏‎ (05:43, 18 February 2009)
  15. Furstenberg correspondence principle‏‎ (23:42, 19 February 2009)
  16. Word algebra‏‎ (17:59, 20 February 2009)
  17. Slice‏‎ (13:47, 21 February 2009)
  18. Influence of variables‏‎ (05:55, 22 February 2009)
  19. Line‏‎ (06:01, 22 February 2009)
  20. Density increment method‏‎ (11:15, 22 February 2009)
  21. Density‏‎ (05:33, 23 February 2009)
  22. DHJ(2.7)‏‎ (22:29, 23 February 2009)
  23. DHJ(2.6)‏‎ (22:29, 23 February 2009)
  24. Furstenberg-Katznelson argument‏‎ (18:43, 24 February 2009)
  25. Szemerédi's theorem‏‎ (17:17, 26 February 2009)
  26. A second Fourier decomposition related to Sperner's theorem‏‎ (14:37, 27 February 2009)
  27. Ajtai-Szemerédi's proof of the corners theorem‏‎ (09:43, 2 March 2009)
  28. Fourier-analytic proof of Sperner‏‎ (04:43, 3 March 2009)
  29. DHJ(3)‏‎ (10:30, 5 March 2009)
  30. Corners‏‎ (18:17, 8 March 2009)
  31. An outline of a density-increment argument‏‎ (21:32, 8 March 2009)
  32. Correlation with a 1-set implies correlation with a subspace‏‎ (10:20, 9 March 2009)
  33. Equal-slices distribution for DHJ(k)‏‎ (17:37, 10 March 2009)
  34. Austin's proof‏‎ (15:35, 12 March 2009)
  35. Bibliography‏‎ (17:34, 12 March 2009)
  36. Abstract regularity lemma‏‎ (01:43, 14 March 2009)
  37. Tidy problem page‏‎ (04:32, 14 March 2009)
  38. Sperner's theorem‏‎ (06:15, 17 March 2009)
  39. A second outline of a density-increment argument‏‎ (05:59, 18 March 2009)
  40. Roth's theorem‏‎ (16:18, 19 March 2009)
  41. Proof of DHJ(3) via density-increment‏‎ (14:58, 20 March 2009)
  42. Austin's proof II‏‎ (19:36, 1 April 2009)
  43. Timeline‏‎ (16:47, 5 April 2009)
  44. Higher-dimensional Fujimura‏‎ (07:28, 14 April 2009)
  45. IP-Szemerédi theorem‏‎ (23:58, 15 April 2009)
  46. A general partitioning principle‏‎ (12:18, 16 April 2009)
  47. Outline of first paper‏‎ (20:08, 21 April 2009)
  48. Modification of the Ajtai-Szemerédi argument‏‎ (11:53, 22 April 2009)
  49. Passing between measures‏‎ (16:55, 23 April 2009)
  50. Line free sets correlate locally with dense sets of complexity k-2‏‎ (12:10, 24 April 2009)
  51. DHJ(k) implies multidimensional DHJ(k)‏‎ (12:10, 24 April 2009)
  52. Ergodic-inspired methods‏‎ (23:08, 29 April 2009)
  53. Biblio.tex‏‎ (18:01, 1 May 2009)
  54. A Hilbert space lemma‏‎ (13:55, 18 May 2009)
  55. Folkman's theorem‏‎ (04:05, 21 May 2009)
  56. Hindman's theorem‏‎ (04:06, 21 May 2009)
  57. DJH(1,3)‏‎ (02:50, 29 May 2009)
  58. Genetic.tex‏‎ (18:43, 31 May 2009)
  59. A general result about density increments‏‎ (21:54, 4 June 2009)
  60. Kakeya problem‏‎ (00:35, 5 June 2009)
  61. Obstructions to uniformity‏‎ (01:02, 5 June 2009)
  62. C code for Moser‏‎ (20:34, 7 June 2009)
  63. Lookup table C code‏‎ (19:14, 9 June 2009)
  64. 3D Moser statistics‏‎ (10:05, 10 June 2009)
  65. A-statistics code‏‎ (10:06, 10 June 2009)
  66. Insensitive.tex‏‎ (13:05, 11 June 2009)
  67. Lookup table‏‎ (13:07, 11 June 2009)
  68. Optimal a-set pairs‏‎ (13:18, 11 June 2009)
  69. Optimal a-set pair code‏‎ (13:18, 11 June 2009)
  70. Stdout output‏‎ (16:50, 11 June 2009)
  71. File output‏‎ (16:50, 11 June 2009)
  72. Dhj.bib‏‎ (12:59, 12 June 2009)
  73. Second lookup table C code‏‎ (18:33, 12 June 2009)
  74. Scanning code‏‎ (18:34, 12 June 2009)
  75. Matlab script‏‎ (08:44, 16 June 2009)
  76. 4D Moser sets with d at least 4 have at most 40 points‏‎ (08:47, 16 June 2009)
  77. 4D Moser sets with d at least 2 have at most 42 points‏‎ (08:48, 16 June 2009)
  78. 4D Moser sets with d at least 3 has at most 41 points‏‎ (08:49, 16 June 2009)
  79. Human proof of the 3D Pareto-optimal Moser statistics‏‎ (08:50, 16 June 2009)
  80. Sperner.tex‏‎ (21:21, 24 June 2009)
  81. Outline.tex‏‎ (21:21, 24 June 2009)
  82. Easy.tex‏‎ (21:22, 24 June 2009)
  83. Outro.tex‏‎ (21:23, 24 June 2009)
  84. Equal-slices measure‏‎ (08:31, 30 June 2009)
  85. Classification of (6,12,18,4,0) sets‏‎ (15:33, 2 July 2009)
  86. 4D Moser brute force search‏‎ (22:12, 6 July 2009)
  87. Dhj.sty‏‎ (13:23, 8 July 2009)
  88. Abstract.tex‏‎ (13:23, 8 July 2009)
  89. Intro.tex‏‎ (13:24, 8 July 2009)
  90. Concepts.tex‏‎ (13:24, 8 July 2009)
  91. Equal-slices.tex‏‎ (13:25, 8 July 2009)
  92. Measures.tex‏‎ (13:25, 8 July 2009)
  93. Correlation.tex‏‎ (13:26, 8 July 2009)
  94. Partitioning.tex‏‎ (13:26, 8 July 2009)
  95. Theproof.tex‏‎ (13:27, 8 July 2009)
  96. Maple calculations‏‎ (21:52, 9 July 2009)
  97. Coloring Hales-Jewett theorem‏‎ (11:18, 19 July 2009)
  98. Fujimura.tex‏‎ (06:46, 27 July 2009)
  99. Higherk.tex‏‎ (06:48, 27 July 2009)
  100. Coloring.tex‏‎ (09:08, 28 July 2009)
  101. The complexity class NP‏‎ (14:19, 28 July 2009)
  102. P=NP implies a deterministic algorithm to find primes‏‎ (14:35, 28 July 2009)
  103. The complexity class DTIME‏‎ (14:38, 28 July 2009)
  104. The complexity class BPP‏‎ (09:28, 29 July 2009)
  105. The complexity class P‏‎ (10:13, 30 July 2009)
  106. Pseudo-random generators (PRG)‏‎ (23:21, 31 July 2009)
  107. The complexity class BQP‏‎ (15:01, 1 August 2009)
  108. Finding primes with O(k) random bits‏‎ (05:07, 3 August 2009)
  109. Friedlander-Iwaniec theorem‏‎ (10:08, 8 August 2009)
  110. Factoring‏‎ (10:24, 8 August 2009)
  111. Cramer's random model for the primes‏‎ (10:39, 8 August 2009)
  112. Hardy-Littlewood prime tuples conjecture‏‎ (10:43, 8 August 2009)
  113. The complexity class promise-BPP‏‎ (06:56, 9 August 2009)
  114. List of results implied by the Riemann Hypothesis‏‎ (14:54, 9 August 2009)
  115. Iterated sumsets of log-primes‏‎ (08:01, 12 August 2009)
  116. Signed sums of prime reciprocals‏‎ (10:43, 12 August 2009)
  117. Bertrand's postulate‏‎ (06:59, 18 August 2009)
  118. Prime gaps‏‎ (16:39, 19 August 2009)
  119. Discrete logarithm‏‎ (16:52, 19 August 2009)
  120. Generic prime‏‎ (17:05, 19 August 2009)
  121. Smooth number‏‎ (17:39, 19 August 2009)
  122. Schinzel's hypothesis H‏‎ (17:49, 19 August 2009)
  123. An efficient algorithm exists if Cramer's conjecture holds‏‎ (18:09, 19 August 2009)
  124. Cramer's conjecture‏‎ (18:10, 19 August 2009)
  125. Odlyzko's method‏‎ (11:02, 22 August 2009)
  126. Kolmogorov complexity‏‎ (06:23, 28 August 2009)
  127. Prime counting function‏‎ (13:58, 31 August 2009)
  128. Polynomial strategy‏‎ (22:46, 18 September 2009)
  129. Genetic algorithm‏‎ (00:15, 20 September 2009)
  130. Corners theorem‏‎ (10:15, 16 October 2009)
  131. TeX files for first paper‏‎ (10:59, 20 October 2009)
  132. Line-free sets correlate locally with complexity-1 sets‏‎ (10:46, 21 October 2009)
  133. Integer.tex‏‎ (16:11, 12 December 2009)
  134. 6th roots of unity‏‎ (12:01, 9 January 2010)
  135. 4th roots of unity‏‎ (12:06, 9 January 2010)
  136. T32-invariant sequences‏‎ (07:21, 10 January 2010)
  137. The HAP-subsequence structure of that sequence‏‎ (09:49, 10 January 2010)
  138. T2(x) = -T3(x)‏‎ (13:03, 10 January 2010)
  139. T2(x) = -x‏‎ (13:38, 10 January 2010)
  140. T2(x) = T5(x) = -x‏‎ (14:39, 10 January 2010)
  141. Convert raw input string into CSV table‏‎ (10:16, 11 January 2010)
  142. Verify the bounded discrepancy of sequence‏‎ (12:44, 11 January 2010)
  143. Verify the bounded discrepancy of an input sequence‏‎ (18:43, 11 January 2010)
  144. Sequence of length 1112‏‎ (10:02, 12 January 2010)
  145. HAP table for Sequence of length 1112‏‎ (10:04, 12 January 2010)
  146. HAP tables for Sequence of length 470‏‎ (10:17, 12 January 2010)
  147. Depth-first search‏‎ (15:06, 12 January 2010)
  148. The first 1124-sequence‏‎ (19:43, 12 January 2010)
  149. T m(x) = (+/-)T n(x)‏‎ (23:59, 12 January 2010)
  150. Search for completely multiplicative sequences‏‎ (02:38, 13 January 2010)
  151. Proposals for finding long low-discrepancy sequences‏‎ (04:19, 13 January 2010)
  152. Limits with better properties‏‎ (05:02, 14 January 2010)
  153. Computing a HAP basis‏‎ (14:44, 14 January 2010)
  154. Dirichlet inverses‏‎ (17:01, 14 January 2010)
  155. Moser.tex‏‎ (23:42, 15 January 2010)
  156. Dhj-lown.tex‏‎ (23:42, 15 January 2010)
  157. Shifts and signs‏‎ (11:07, 17 January 2010)
  158. Length 1124 sequences‏‎ (14:50, 18 January 2010)
  159. The prime factors of the places where the first two sequences of length 1124 differ‏‎ (14:57, 18 January 2010)
  160. Sequence of length 1091‏‎ (15:37, 18 January 2010)
  161. Dhj-lown-lower.tex‏‎ (19:33, 19 January 2010)
  162. Moser-lower.tex‏‎ (19:34, 19 January 2010)
  163. Estimate the number of discrepancy 2 sequences‏‎ (14:20, 20 January 2010)
  164. Sequences given by modulated Sturmian functions‏‎ (23:18, 20 January 2010)
  165. Sequence of length 3250‏‎ (02:42, 21 January 2010)
  166. Short sequences statistics‏‎ (11:03, 22 January 2010)
  167. Low discrepancy on PAPs‏‎ (00:23, 23 January 2010)
  168. Introduction.tex‏‎ (00:52, 23 January 2010)
  169. Outline of second paper‏‎ (09:27, 23 January 2010)
  170. First obtain multiplicative structure and then obtain a contradiction‏‎ (12:27, 23 January 2010)
  171. Character-like functions‏‎ (14:46, 24 January 2010)
  172. Drift‏‎ (02:21, 25 January 2010)
  173. Topological dynamics formulation‏‎ (09:50, 25 January 2010)
  174. Upper and lower discrepancy‏‎ (13:59, 25 January 2010)
  175. Polymath.tex‏‎ (20:37, 25 January 2010)
  176. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity‏‎ (01:56, 28 January 2010)
  177. Prove the result for shifted HAPs instead of HAPs‏‎ (15:02, 28 January 2010)
  178. Algorithm for finding multiplicative sequences with bounded discrepancy‏‎ (06:44, 29 January 2010)
  179. Multiplicative.c‏‎ (09:43, 2 February 2010)
  180. Wirsing translation‏‎ (17:50, 2 February 2010)
  181. Computer proof that completely multiplicative sequences have discrepancy greater than 2‏‎ (09:59, 3 February 2010)
  182. Multiplicative sequences‏‎ (20:44, 5 February 2010)
  183. Discrepancy 3 multiplicative sequence of length 13186‏‎ (00:45, 6 February 2010)
  184. Depth-first search for multiplicative sequences‏‎ (05:44, 6 February 2010)
  185. Find a good configuration of HAPs‏‎ (08:45, 7 February 2010)
  186. Create tables in an HTML file from an input sequence‏‎ (18:46, 18 February 2010)
  187. Pseudointegers‏‎ (01:17, 23 February 2010)
  188. Vectors for the dual SDP‏‎ (12:57, 4 March 2010)
  189. Forced Drifts in Multiplicative Sequences‏‎ (20:32, 2 April 2010)
  190. Forced Drift of Six in Multiplicative Sequences‏‎ (07:25, 3 April 2010)
  191. Polymath1‏‎ (13:58, 23 April 2010)
  192. Fourier reduction‏‎ (17:46, 12 May 2010)
  193. Omega(N)‏‎ (11:01, 13 May 2010)
  194. Generalize to a graph-theoretic formulation‏‎ (09:39, 25 May 2010)
  195. Definable Banach Spaces‏‎ (01:32, 10 June 2010)
  196. Bounded Dirichlet inverse‏‎ (23:03, 21 June 2010)
  197. Representation of the diagonal‏‎ (09:18, 3 July 2010)
  198. Obtaining the correct bound in Roth's discrepancy theorem‏‎ (13:53, 3 July 2010)
  199. Quasirandomness‏‎ (06:08, 8 July 2010)
  200. Roth's Theorem concerning discrepancy on Arithmetic Progression‏‎ (17:07, 16 July 2010)
  201. Imo 2010‏‎ (05:04, 26 July 2010)
  202. Sequence of length 714‏‎ (06:49, 31 July 2010)
  203. Refined greedy computation of multiplicative sequences‏‎ (06:50, 31 July 2010)
  204. Bounding the discrepancy in terms of the common difference‏‎ (00:09, 2 August 2010)
  205. Function field version‏‎ (06:11, 5 August 2010)
  206. Immerman-Vardi theorem‏‎ (08:07, 10 August 2010)
  207. Update‏‎ (17:35, 11 August 2010)
  208. Lindell's Critique‏‎ (20:18, 11 August 2010)
  209. Immerman's letter‏‎ (23:56, 12 August 2010)
  210. Thue-Morse-Hedlund Sequence‏‎ (06:26, 13 August 2010)
  211. Random k-SAT‏‎ (10:29, 15 August 2010)
  212. Polylog parameterizability‏‎ (21:07, 18 August 2010)
  213. Hyper-optimistic conjecture‏‎ (15:49, 22 August 2010)
  214. "Low Dimensions" grant acknowledgments‏‎ (13:46, 23 August 2010)
  215. Online reactions to Deolalikar P vs NP paper‏‎ (00:03, 17 September 2010)
  216. Matryoshka Sequences‏‎ (06:28, 29 September 2010)
  217. Low discrepancy on primes and powers of 2‏‎ (06:53, 3 October 2010)
  218. Longest constrained sequences‏‎ (11:21, 8 October 2010)
  219. Length 1120 sequences‏‎ (12:47, 8 October 2010)
  220. Updating partial sums with Fenwick tree‏‎ (19:37, 27 December 2010)
  221. Basic facts about Bohr sets‏‎ (09:56, 6 February 2011)
  222. Dhj.tex‏‎ (16:14, 6 February 2011)
  223. BK:Section 3‏‎ (21:13, 7 February 2011)
  224. Improving the bounds for Roth's theorem‏‎ (05:28, 12 February 2011)
  225. Finding primes‏‎ (04:18, 14 February 2011)
  226. Oracle counterexample to finding pseudoprimes‏‎ (19:17, 24 February 2011)
  227. Polymath4 grant acknowledgments‏‎ (10:15, 3 April 2011)
  228. The polynomial Hirsch conjecture‏‎ (13:31, 14 August 2011)
  229. Deolalikar P vs NP paper‏‎ (16:42, 30 September 2011)
  230. Quantum Arrow's Theorem‏‎ (09:21, 8 October 2011)
  231. Boshernitzan’s problem‏‎ (03:55, 3 January 2012)
  232. Meissel-Lehmer method‏‎ (23:39, 28 February 2012)
  233. Original Elsevier statement‏‎ (12:55, 2 March 2012)
  234. Imo 2011‏‎ (14:20, 3 June 2012)
  235. Thin triangles‏‎ (11:50, 12 June 2012)
  236. Stability of eigenfunctions‏‎ (15:42, 14 July 2012)
  237. Overlapping Schwarz‏‎ (18:39, 18 July 2012)
  238. Imo 2012‏‎ (09:58, 5 August 2012)
  239. The cost of knowledge‏‎ (12:30, 28 September 2012)
  240. Que porra n tem nada pra fazer network penetration test‏‎ (13:30, 30 December 2012)
  241. Jun Fukuyama's P≠NP Paper‏‎ (09:26, 6 February 2013)
  242. Journal publishing reform‏‎ (18:31, 10 April 2013)
  243. Imo 2009 q6‏‎ (12:19, 13 June 2013)
  244. Higher-dimensional DHJ numbers‏‎ (20:25, 15 June 2013)
  245. Benchmarks of small admissible tuples‏‎ (17:30, 20 June 2013)
  246. W-trick‏‎ (03:05, 5 July 2013)
  247. Dickson-Hardy-Littlewood theorems‏‎ (19:53, 27 July 2013)
  248. Distribution of primes in smooth moduli‏‎ (11:56, 11 October 2013)
  249. Finding optimal k0 values‏‎ (16:14, 20 October 2013)
  250. Complexity of a set‏‎ (13:06, 30 October 2013)

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

Retrieved from "http://michaelnielsen.org/polymath1/index.php?title=Special:AncientPages"