Long pages

From Polymath1Wiki
Jump to: navigation, search

Showing below up to 100 results in range #101 to #200.

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

  1. (hist) ‎Word algebra ‎[10,657 bytes]
  2. (hist) ‎Density increment method ‎[10,599 bytes]
  3. (hist) ‎Find set configurations that imply FUNC ‎[10,532 bytes]
  4. (hist) ‎The first 1124-sequence ‎[10,510 bytes]
  5. (hist) ‎Linear norm ‎[10,503 bytes]
  6. (hist) ‎Zero-free regions ‎[10,474 bytes]
  7. (hist) ‎Line free sets correlate locally with dense sets of complexity k-2 ‎[10,416 bytes]
  8. (hist) ‎Optimal a-set pair code ‎[10,353 bytes]
  9. (hist) ‎Bertrand's postulate ‎[10,225 bytes]
  10. (hist) ‎Polymath1 ‎[10,169 bytes]
  11. (hist) ‎3D Moser statistics ‎[10,105 bytes]
  12. (hist) ‎Depth-first search ‎[10,102 bytes]
  13. (hist) ‎Find a good configuration of HAPs ‎[9,967 bytes]
  14. (hist) ‎IP-Szemerédi theorem ‎[9,930 bytes]
  15. (hist) ‎Pseudointegers ‎[9,794 bytes]
  16. (hist) ‎Tidy problem page ‎[9,465 bytes]
  17. (hist) ‎Easy.tex ‎[9,055 bytes]
  18. (hist) ‎Other proposed projects ‎[8,921 bytes]
  19. (hist) ‎Dhj-lown-lower.tex ‎[8,877 bytes]
  20. (hist) ‎Sperner.tex ‎[8,669 bytes]
  21. (hist) ‎Side Proof 3 ‎[8,653 bytes]
  22. (hist) ‎Imo 2011 ‎[8,524 bytes]
  23. (hist) ‎Correlation.tex ‎[8,324 bytes]
  24. (hist) ‎Matlab script ‎[8,211 bytes]
  25. (hist) ‎Lemma 1 ‎[8,167 bytes]
  26. (hist) ‎Furstenberg correspondence principle ‎[8,144 bytes]
  27. (hist) ‎4D Moser sets with d at least 2 have at most 42 points ‎[8,000 bytes]
  28. (hist) ‎Frankl's union-closed conjecture ‎[7,809 bytes]
  29. (hist) ‎A general partitioning principle ‎[7,785 bytes]
  30. (hist) ‎Insensitive.tex ‎[7,629 bytes]
  31. (hist) ‎Oracle counterexample to finding pseudoprimes ‎[7,588 bytes]
  32. (hist) ‎Roth's Theorem concerning discrepancy on Arithmetic Progression ‎[7,561 bytes]
  33. (hist) ‎Higher-dimensional DHJ numbers ‎[7,473 bytes]
  34. (hist) ‎Dirichlet inverses ‎[7,446 bytes]
  35. (hist) ‎Modification of the Ajtai-Szemerédi argument ‎[7,441 bytes]
  36. (hist) ‎Polymath.tex ‎[7,407 bytes]
  37. (hist) ‎Estimate the number of discrepancy 2 sequences ‎[7,186 bytes]
  38. (hist) ‎Fourier-analytic proof of Sperner ‎[7,128 bytes]
  39. (hist) ‎Iterated sumsets of log-primes ‎[7,118 bytes]
  40. (hist) ‎Bounding the derivative of H t - third approach ‎[7,109 bytes]
  41. (hist) ‎Bounding the discrepancy in terms of the common difference ‎[7,053 bytes]
  42. (hist) ‎Create tables in an HTML file from an input sequence ‎[7,018 bytes]
  43. (hist) ‎Update ‎[6,949 bytes]
  44. (hist) ‎Side Proof 10 ‎[6,724 bytes]
  45. (hist) ‎Low discrepancy on PAPs ‎[6,721 bytes]
  46. (hist) ‎Sperner's theorem ‎[6,572 bytes]
  47. (hist) ‎DHJ(1,3) ‎[6,550 bytes]
  48. (hist) ‎T m(x) = (+/-)T n(x) ‎[6,371 bytes]
  49. (hist) ‎Partitioning.tex ‎[6,350 bytes]
  50. (hist) ‎Higherk.tex ‎[6,323 bytes]
  51. (hist) ‎Equal-slices distribution for DHJ(k) ‎[6,254 bytes]
  52. (hist) ‎A-statistics code ‎[6,211 bytes]
  53. (hist) ‎Computing a HAP basis ‎[6,179 bytes]
  54. (hist) ‎Outline of second paper ‎[6,145 bytes]
  55. (hist) ‎Overlapping Schwarz ‎[6,077 bytes]
  56. (hist) ‎Depth-first search for multiplicative sequences ‎[6,064 bytes]
  57. (hist) ‎Ergodic perspective ‎[5,712 bytes]
  58. (hist) ‎A Hilbert space lemma ‎[5,659 bytes]
  59. (hist) ‎Topological dynamics formulation ‎[5,599 bytes]
  60. (hist) ‎Stdout output ‎[5,585 bytes]
  61. (hist) ‎Immerman's letter ‎[5,561 bytes]
  62. (hist) ‎Drift ‎[5,553 bytes]
  63. (hist) ‎Genetic algorithm ‎[5,490 bytes]
  64. (hist) ‎Obstructions to uniformity ‎[5,460 bytes]
  65. (hist) ‎Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity ‎[5,449 bytes]
  66. (hist) ‎Boshernitzan’s problem ‎[5,421 bytes]
  67. (hist) ‎Polymath8 grant acknowledgments ‎[5,366 bytes]
  68. (hist) ‎C code for Moser ‎[5,341 bytes]
  69. (hist) ‎Multiplicative.c ‎[5,268 bytes]
  70. (hist) ‎BK:Section 3 ‎[5,254 bytes]
  71. (hist) ‎DHJ(2.6) ‎[5,155 bytes]
  72. (hist) ‎4D Moser sets with d at least 3 has at most 41 points ‎[5,067 bytes]
  73. (hist) ‎Bounded discrepancy multiplicative functions do not correlate with characters ‎[5,056 bytes]
  74. (hist) ‎Lemma 8 ‎[4,999 bytes]
  75. (hist) ‎Lemma 7.5 ‎[4,941 bytes]
  76. (hist) ‎Maximal discrepancy-2 sequence ‎[4,928 bytes]
  77. (hist) ‎Side Proof 2 ‎[4,853 bytes]
  78. (hist) ‎Lindell's Critique ‎[4,820 bytes]
  79. (hist) ‎Jun Fukuyama's P≠NP Paper ‎[4,808 bytes]
  80. (hist) ‎Riemann-Siegel formula ‎[4,765 bytes]
  81. (hist) ‎Pseudo-random generators (PRG) ‎[4,736 bytes]
  82. (hist) ‎Updating partial sums with Fenwick tree ‎[4,712 bytes]
  83. (hist) ‎Integer.tex ‎[4,708 bytes]
  84. (hist) ‎Kakeya problem ‎[4,701 bytes]
  85. (hist) ‎Lookup table ‎[4,631 bytes]
  86. (hist) ‎Wirsing translation ‎[4,551 bytes]
  87. (hist) ‎Ergodic-inspired methods ‎[4,540 bytes]
  88. (hist) ‎Bounding the derivative of H t ‎[4,473 bytes]
  89. (hist) ‎Fourier reduction ‎[4,297 bytes]
  90. (hist) ‎Outline of first paper ‎[4,289 bytes]
  91. (hist) ‎A general result about density increments ‎[4,156 bytes]
  92. (hist) ‎Original Elsevier statement ‎[4,139 bytes]
  93. (hist) ‎Basic facts about Bohr sets ‎[4,137 bytes]
  94. (hist) ‎Generalize to a graph-theoretic formulation ‎[4,137 bytes]
  95. (hist) ‎Matryoshka Sequences ‎[4,095 bytes]
  96. (hist) ‎Abstract regularity lemma ‎[4,045 bytes]
  97. (hist) ‎Polynomial strategy ‎[4,038 bytes]
  98. (hist) ‎Triangle removal lemma ‎[4,020 bytes]
  99. (hist) ‎Classification of (6,12,18,4,0) sets ‎[3,974 bytes]
  100. (hist) ‎Coloring.tex ‎[3,969 bytes]

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