Pages with the most revisions

From Polymath Wiki
Jump to: navigation, search

Showing below up to 100 results in range #151 to #250.

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

  1. Horn clause formulation‏‎ (7 revisions)
  2. Bounding the derivative of H t‏‎ (7 revisions)
  3. Graham-Rothschild theorem‏‎ (7 revisions)
  4. Length 1120 sequences‏‎ (7 revisions)
  5. Representation of the diagonal‏‎ (7 revisions)
  6. The complexity class BPP‏‎ (7 revisions)
  7. Polymath1‏‎ (7 revisions)
  8. Estimating a sum‏‎ (7 revisions)
  9. Side Proof 5‏‎ (6 revisions)
  10. T2(x) = -x‏‎ (6 revisions)
  11. Carlson-Simpson theorem‏‎ (6 revisions)
  12. Shifts and signs‏‎ (6 revisions)
  13. Sylvester's sequence‏‎ (6 revisions)
  14. Bounded discrepancy multiplicative functions do not correlate with characters‏‎ (6 revisions)
  15. Slice‏‎ (6 revisions)
  16. Oracle counterexample to finding pseudoprimes‏‎ (6 revisions)
  17. Update‏‎ (6 revisions)
  18. Multiplicative.c‏‎ (6 revisions)
  19. Lookup table‏‎ (6 revisions)
  20. Sequence of length 3250‏‎ (5 revisions)
  21. Folkman's theorem‏‎ (5 revisions)
  22. Pseudointegers‏‎ (5 revisions)
  23. A Hilbert space lemma‏‎ (5 revisions)
  24. Sequences given by modulated Sturmian functions‏‎ (5 revisions)
  25. Forced Drifts in Multiplicative Sequences‏‎ (5 revisions)
  26. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity‏‎ (5 revisions)
  27. Higher-dimensional Fujimura‏‎ (5 revisions)
  28. Cramer's conjecture‏‎ (5 revisions)
  29. Genetic algorithm‏‎ (5 revisions)
  30. Lemma 8‏‎ (5 revisions)
  31. Abstract.tex‏‎ (5 revisions)
  32. DHJ(1,3)‏‎ (5 revisions)
  33. Theproof.tex‏‎ (5 revisions)
  34. DHJ(2.6)‏‎ (5 revisions)
  35. Thin triangles‏‎ (5 revisions)
  36. Outline of first paper‏‎ (4 revisions)
  37. Roth's Theorem concerning discrepancy on Arithmetic Progression‏‎ (4 revisions)
  38. Thue-Morse-Hedlund Sequence‏‎ (4 revisions)
  39. Roth's theorem‏‎ (4 revisions)
  40. Furstenberg correspondence principle‏‎ (4 revisions)
  41. Sequence of length 714‏‎ (4 revisions)
  42. Verify the bounded discrepancy of an input sequence‏‎ (4 revisions)
  43. Scanning code‏‎ (4 revisions)
  44. Carlson's theorem‏‎ (4 revisions)
  45. An efficient algorithm exists if Cramer's conjecture holds‏‎ (4 revisions)
  46. Boshernitzan’s problem‏‎ (4 revisions)
  47. Stirling's formula‏‎ (4 revisions)
  48. W-trick‏‎ (4 revisions)
  49. Lemma 7‏‎ (4 revisions)
  50. Discretized Borel Determinacy and P=NP‏‎ (4 revisions)
  51. Concepts.tex‏‎ (4 revisions)
  52. Hindman's theorem‏‎ (4 revisions)
  53. Unsolved problems‏‎ (4 revisions)
  54. Prime gaps‏‎ (4 revisions)
  55. Dhj.bib‏‎ (4 revisions)
  56. The prime factors of the places where the first two sequences of length 1124 differ‏‎ (4 revisions)
  57. Drift‏‎ (4 revisions)
  58. Convert raw input string into CSV table‏‎ (4 revisions)
  59. Kolmogorov complexity‏‎ (4 revisions)
  60. Influence of variables‏‎ (4 revisions)
  61. Sequence of length 1112‏‎ (3 revisions)
  62. Upper and lower discrepancy‏‎ (3 revisions)
  63. Polymath15 grant acknowledgments‏‎ (3 revisions)
  64. Low discrepancy on PAPs‏‎ (3 revisions)
  65. "New Proof" grant acknowledgments‏‎ (3 revisions)
  66. Bibliography‏‎ (3 revisions)
  67. Dirichlet inverses‏‎ (3 revisions)
  68. Intransitive dice‏‎ (3 revisions)
  69. Low discrepancy on primes and powers of 2‏‎ (3 revisions)
  70. Polymath4 grant acknowledgments‏‎ (3 revisions)
  71. 3D Moser statistics‏‎ (3 revisions)
  72. Correlation with a 1-set implies correlation with a subspace‏‎ (3 revisions)
  73. Schinzel's hypothesis H‏‎ (3 revisions)
  74. Side Proof 9‏‎ (3 revisions)
  75. Immerman-Vardi theorem‏‎ (3 revisions)
  76. P=NP implies a deterministic algorithm to find primes‏‎ (3 revisions)
  77. Character-like functions‏‎ (3 revisions)
  78. Topological dynamics formulation‏‎ (3 revisions)
  79. Polynomial strategy‏‎ (3 revisions)
  80. Definable Banach Spaces‏‎ (3 revisions)
  81. Second lookup table C code‏‎ (3 revisions)
  82. Ergodic perspective‏‎ (3 revisions)
  83. Szemerédi's theorem‏‎ (3 revisions)
  84. Estimate the number of discrepancy 2 sequences‏‎ (3 revisions)
  85. Matryoshka Sequences‏‎ (3 revisions)
  86. Function field version‏‎ (3 revisions)
  87. Corners‏‎ (2 revisions)
  88. First obtain multiplicative structure and then obtain a contradiction‏‎ (2 revisions)
  89. Lindell's Critique‏‎ (2 revisions)
  90. Sperner.tex‏‎ (2 revisions)
  91. Lookup table C code‏‎ (2 revisions)
  92. Algebraic line‏‎ (2 revisions - redirect page)
  93. Deolaikar's P!=NP paper‏‎ (2 revisions - redirect page)
  94. Vectors for the dual SDP‏‎ (2 revisions)
  95. Pseudo-random generators (PRG)‏‎ (2 revisions)
  96. The complexity class NP‏‎ (2 revisions)
  97. Obtaining the correct bound in Roth's discrepancy theorem‏‎ (2 revisions)
  98. C code for Moser‏‎ (2 revisions)
  99. Algorithm for finding multiplicative sequences with bounded discrepancy‏‎ (2 revisions)
  100. T2(x) = T5(x) = -x‏‎ (2 revisions)

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