Uncategorized pages

From Polymath Wiki
Jump to navigationJump to search

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

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

  1. Folkman's theorem
  2. Forced Drift of Six in Multiplicative Sequences
  3. Forced Drifts in Multiplicative Sequences
  4. Fourier-analytic proof of Sperner
  5. Fourier reduction
  6. Friedlander-Iwaniec theorem
  7. Fujimura's problem
  8. Fujimura.tex
  9. Function field version
  10. Furstenberg-Katznelson argument
  11. Furstenberg correspondence principle
  12. Generalize to a graph-theoretic formulation
  13. Generic prime
  14. Genetic.tex
  15. Genetic algorithm
  16. Graham-Rothschild theorem
  17. HAP table for Sequence of length 1112
  18. HAP tables for Sequence of length 470
  19. Hardy-Littlewood prime tuples conjecture
  20. Higher-dimensional DHJ numbers
  21. Higher-dimensional Fujimura
  22. Higherk.tex
  23. Hindman's theorem
  24. Human proof of the 3D Pareto-optimal Moser statistics
  25. Human proof that completely multiplicative sequences have discrepancy greater than 2
  26. Human proof that completely multiplicative sequences have discrepancy greater than 3
  27. Hyper-optimistic conjecture
  28. IP-Szemerédi theorem
  29. Immerman's letter
  30. Immerman-Vardi theorem
  31. Imo 2009 q6
  32. Imo 2010
  33. Imo 2011
  34. Imo 2012
  35. Improving the bounds for Roth's theorem
  36. Influence of variables
  37. Insensitive.tex
  38. Integer.tex
  39. Intransitive dice
  40. Intro.tex
  41. Introduction.tex
  42. Iterated sumsets of log-primes
  43. Journal publishing reform
  44. Jun Fukuyama's P≠NP Paper
  45. Kakeya problem
  46. Kolmogorov complexity
  47. Kruskal-Katona theorem
  48. Lemma 1
  49. Lemma 7
  50. Lemma 7.5
  51. Lemma 7.6
  52. Lemma 8
  53. Length 1120 sequences
  54. Length 1124 sequences
  55. Limits with better properties
  56. Lindell's Critique
  57. Line
  58. Line-free sets correlate locally with complexity-1 sets
  59. Line free sets correlate locally with dense sets of complexity k-2
  60. Linear norm
  61. Linear norm grant acknowledgments
  62. List of results implied by the Riemann Hypothesis
  63. Logo
  64. Longest constrained sequences
  65. Lookup table
  66. Lookup table C code
  67. Low discrepancy on PAPs
  68. Low discrepancy on primes and powers of 2
  69. M=13 Theorem
  70. M=13 case of FUNC
  71. Main Page
  72. Maple calculations
  73. Matlab script
  74. Matryoshka Sequences
  75. Maximal discrepancy-2 sequence
  76. Measures.tex
  77. Meissel-Lehmer method
  78. Modification of the Ajtai-Szemerédi argument
  79. Moser's cube problem
  80. Moser-lower.tex
  81. Moser.tex
  82. Multiplicative.c
  83. Multiplicative sequences
  84. Notes on polytope decomposition
  85. Obstructions to uniformity
  86. Obtaining the correct bound in Roth's discrepancy theorem
  87. Odlyzko's method
  88. Omega(N)
  89. Online reactions to Deolalikar P vs NP paper
  90. Optimal a-set pair code
  91. Optimal a-set pairs
  92. Oracle counterexample to finding pseudoprimes
  93. Original Elsevier statement
  94. Other proposed projects
  95. Outline.tex
  96. Outline of first paper
  97. Outline of second paper
  98. Outro.tex
  99. Overlapping Schwarz
  100. P=NP implies a deterministic algorithm to find primes

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