Pages with the fewest revisions

From Polymath1Wiki
Jump to: navigation, search

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

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

  1. Algorithm for finding multiplicative sequences with bounded discrepancy‏‎ (2 revisions)
  2. T32-invariant sequences‏‎ (2 revisions)
  3. Side Proof 8‏‎ (2 revisions)
  4. Immerman's letter‏‎ (2 revisions)
  5. M=13 Theorem‏‎ (2 revisions)
  6. Overlapping Schwarz‏‎ (2 revisions)
  7. DJH(1,3)‏‎ (2 revisions)
  8. Generic prime‏‎ (2 revisions)
  9. Discrete logarithm‏‎ (2 revisions)
  10. Equal-slices distribution for DHJ(k)‏‎ (2 revisions)
  11. Genetic.tex‏‎ (2 revisions)
  12. Concentration of measure‏‎ (2 revisions)
  13. Depth-first search for multiplicative sequences‏‎ (2 revisions)
  14. Lemma 7.5‏‎ (2 revisions)
  15. Bounded Dirichlet inverse‏‎ (2 revisions)
  16. Szemerédi's combinatorial proof of Roth's theorem‏‎ (2 revisions)
  17. Triangle removal lemma‏‎ (2 revisions)
  18. Szemerédi's original proof of Szemerédi's theorem‏‎ (2 revisions)
  19. Density‏‎ (2 revisions)
  20. Friedlander-Iwaniec theorem‏‎ (2 revisions)
  21. Density-increment methods‏‎ (2 revisions - redirect page)
  22. Original Elsevier statement‏‎ (2 revisions)
  23. Coloring R 2‏‎ (2 revisions)
  24. Smooth number‏‎ (2 revisions)
  25. Maximal discrepancy-2 sequence‏‎ (2 revisions)
  26. Abstract regularity lemma‏‎ (2 revisions)
  27. 6th roots of unity‏‎ (2 revisions)
  28. Corners‏‎ (2 revisions)
  29. First obtain multiplicative structure and then obtain a contradiction‏‎ (2 revisions)
  30. Lindell's Critique‏‎ (2 revisions)
  31. Lookup table C code‏‎ (2 revisions)
  32. Sperner.tex‏‎ (2 revisions)
  33. Deolaikar's P!=NP paper‏‎ (2 revisions - redirect page)
  34. Vectors for the dual SDP‏‎ (2 revisions)
  35. Obtaining the correct bound in Roth's discrepancy theorem‏‎ (2 revisions)
  36. Pseudo-random generators (PRG)‏‎ (2 revisions)
  37. The complexity class NP‏‎ (2 revisions)
  38. C code for Moser‏‎ (2 revisions)
  39. Algebraic line‏‎ (2 revisions - redirect page)
  40. T2(x) = T5(x) = -x‏‎ (2 revisions)
  41. Factoring‏‎ (2 revisions)
  42. Odlyzko's method‏‎ (2 revisions)
  43. The complexity class P‏‎ (2 revisions)
  44. Forced Drift of Six in Multiplicative Sequences‏‎ (2 revisions)
  45. Outro.tex‏‎ (2 revisions)
  46. Polymath4 grant acknowledgments‏‎ (3 revisions)
  47. "New Proof" grant acknowledgments‏‎ (3 revisions)
  48. Bibliography‏‎ (3 revisions)
  49. Correlation with a 1-set implies correlation with a subspace‏‎ (3 revisions)
  50. Schinzel's hypothesis H‏‎ (3 revisions)
  51. 3D Moser statistics‏‎ (3 revisions)
  52. Side Proof 9‏‎ (3 revisions)
  53. Immerman-Vardi theorem‏‎ (3 revisions)
  54. P=NP implies a deterministic algorithm to find primes‏‎ (3 revisions)
  55. Character-like functions‏‎ (3 revisions)
  56. Topological dynamics formulation‏‎ (3 revisions)
  57. Polynomial strategy‏‎ (3 revisions)
  58. Definable Banach Spaces‏‎ (3 revisions)
  59. Second lookup table C code‏‎ (3 revisions)
  60. Ergodic perspective‏‎ (3 revisions)
  61. Matryoshka Sequences‏‎ (3 revisions)
  62. Szemerédi's theorem‏‎ (3 revisions)
  63. Estimate the number of discrepancy 2 sequences‏‎ (3 revisions)
  64. Function field version‏‎ (3 revisions)
  65. Sequence of length 1112‏‎ (3 revisions)
  66. Upper and lower discrepancy‏‎ (3 revisions)
  67. Polymath15 grant acknowledgments‏‎ (3 revisions)
  68. Low discrepancy on PAPs‏‎ (3 revisions)
  69. Dirichlet inverses‏‎ (3 revisions)
  70. Low discrepancy on primes and powers of 2‏‎ (3 revisions)
  71. Intransitive dice‏‎ (3 revisions)
  72. Stirling's formula‏‎ (4 revisions)
  73. An efficient algorithm exists if Cramer's conjecture holds‏‎ (4 revisions)
  74. W-trick‏‎ (4 revisions)
  75. Lemma 7‏‎ (4 revisions)
  76. Boshernitzan’s problem‏‎ (4 revisions)
  77. Discretized Borel Determinacy and P=NP‏‎ (4 revisions)
  78. Concepts.tex‏‎ (4 revisions)
  79. Hindman's theorem‏‎ (4 revisions)
  80. Unsolved problems‏‎ (4 revisions)
  81. Prime gaps‏‎ (4 revisions)
  82. Dhj.bib‏‎ (4 revisions)
  83. The prime factors of the places where the first two sequences of length 1124 differ‏‎ (4 revisions)
  84. Drift‏‎ (4 revisions)
  85. Convert raw input string into CSV table‏‎ (4 revisions)
  86. Kolmogorov complexity‏‎ (4 revisions)
  87. Influence of variables‏‎ (4 revisions)
  88. Outline of first paper‏‎ (4 revisions)
  89. Roth's Theorem concerning discrepancy on Arithmetic Progression‏‎ (4 revisions)
  90. Thue-Morse-Hedlund Sequence‏‎ (4 revisions)
  91. Roth's theorem‏‎ (4 revisions)
  92. Furstenberg correspondence principle‏‎ (4 revisions)
  93. Sequence of length 714‏‎ (4 revisions)
  94. Verify the bounded discrepancy of an input sequence‏‎ (4 revisions)
  95. Scanning code‏‎ (4 revisions)
  96. Carlson's theorem‏‎ (4 revisions)
  97. Sequences given by modulated Sturmian functions‏‎ (5 revisions)
  98. Forced Drifts in Multiplicative Sequences‏‎ (5 revisions)
  99. A Hilbert space lemma‏‎ (5 revisions)
  100. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity‏‎ (5 revisions)

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