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

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