Uncategorized pages

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. "Low Dimensions" grant acknowledgments
  2. "New Proof" grant acknowledgments
  3. 3D Moser statistics
  4. 4D Moser brute force search
  5. 4D Moser sets with d at least 2 have at most 42 points
  6. 4D Moser sets with d at least 3 has at most 41 points
  7. 4D Moser sets with d at least 4 have at most 40 points
  8. 4th roots of unity
  9. 6th roots of unity
  10. A-statistics code
  11. ABC conjecture
  12. A Hilbert space lemma
  13. A general partitioning principle
  14. A general result about density increments
  15. A second Fourier decomposition related to Sperner's theorem
  16. A second outline of a density-increment argument
  17. Abstract.tex
  18. Abstract regularity lemma
  19. Ajtai-Szemerédi's proof of the corners theorem
  20. Algorithm for finding multiplicative sequences with bounded discrepancy
  21. An efficient algorithm exists if Cramer's conjecture holds
  22. An outline of a density-increment argument
  23. Austin's proof
  24. Austin's proof II
  25. BK:Section 3
  26. Basic facts about Bohr sets
  27. Benchmarks of small admissible tuples
  28. Bertrand's postulate
  29. Biblio.tex
  30. Bibliography
  31. Boshernitzan’s problem
  32. Bounded Dirichlet inverse
  33. Bounded discrepancy multiplicative functions do not correlate with characters
  34. Bounded gaps between primes
  35. Bounding the discrepancy in terms of the common difference
  36. C code for Moser
  37. Carlson's theorem
  38. Carlson-Simpson theorem
  39. Character-like functions
  40. Classification of (6,12,18,4,0) sets
  41. Coloring.tex
  42. Coloring Hales-Jewett theorem
  43. Combinatorial subspace
  44. Complexity of a set
  45. Computer proof that completely multiplicative sequences have discrepancy greater than 2
  46. Computing a HAP basis
  47. Concentration of measure
  48. Concepts.tex
  49. Convert raw input string into CSV table
  50. Corners
  51. Corners theorem
  52. Correlation.tex
  53. Correlation with a 1-set implies correlation with a subspace
  54. Cramer's conjecture
  55. Cramer's random model for the primes
  56. Create tables in an HTML file from an input sequence
  57. DHJ(1,3)
  58. DHJ(2.6)
  59. DHJ(2.7)
  60. DHJ(3)
  61. DHJ(k) implies multidimensional DHJ(k)
  62. DJH(1,3)
  63. Definable Banach Spaces
  64. Density
  65. Density increment method
  66. Deolalikar P vs NP paper
  67. Depth-first search
  68. Depth-first search for multiplicative sequences
  69. Dhj-lown-lower.tex
  70. Dhj-lown.tex
  71. Dhj.bib
  72. Dhj.sty
  73. Dhj.tex
  74. Dickson-Hardy-Littlewood theorems
  75. Different upper and lower bound
  76. Dirichlet inverses
  77. Discrepancy 3 multiplicative sequence of length 13186
  78. Discrete logarithm
  79. Discretized Borel Determinacy and P=NP
  80. Distribution of primes in smooth moduli
  81. Drift
  82. Dynamics of zeros
  83. Easy.tex
  84. Equal-slices.tex
  85. Equal-slices distribution for DHJ(k)
  86. Equal-slices measure
  87. Ergodic-inspired methods
  88. Ergodic perspective
  89. Estimate the number of discrepancy 2 sequences
  90. Experimental results
  91. Factoring
  92. File output
  93. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity
  94. Find a good configuration of HAPs
  95. Finding narrow admissible tuples
  96. Finding optimal k0 values
  97. Finding primes
  98. Finding primes with O(k) random bits
  99. First obtain multiplicative structure and then obtain a contradiction
  100. Folkman's theorem

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