Uncategorized pages

From Polymath Wiki
Jump to navigationJump to search

Showing below up to 50 results in range #21 to #70.

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

  1. An efficient algorithm exists if Cramer's conjecture holds
  2. An outline of a density-increment argument
  3. Austin's proof
  4. Austin's proof II
  5. BK:Section 3
  6. Basic facts about Bohr sets
  7. Benchmarks of small admissible tuples
  8. Bertrand's postulate
  9. Biblio.tex
  10. Bibliography
  11. Boshernitzan’s problem
  12. Bounded Dirichlet inverse
  13. Bounded discrepancy multiplicative functions do not correlate with characters
  14. Bounded gaps between primes
  15. Bounding the discrepancy in terms of the common difference
  16. COVID-19 dataset clearinghouse
  17. C code for Moser
  18. Carlson's theorem
  19. Carlson-Simpson theorem
  20. Character-like functions
  21. Classification of (6,12,18,4,0) sets
  22. Coloring.tex
  23. Coloring Hales-Jewett theorem
  24. Combinatorial subspace
  25. Complexity of a set
  26. Computer proof that completely multiplicative sequences have discrepancy greater than 2
  27. Computing a HAP basis
  28. Concentration of measure
  29. Concepts.tex
  30. Convert raw input string into CSV table
  31. Corners
  32. Corners theorem
  33. Correlation.tex
  34. Correlation with a 1-set implies correlation with a subspace
  35. Cramer's conjecture
  36. Cramer's random model for the primes
  37. Create tables in an HTML file from an input sequence
  38. DHJ(1,3)
  39. DHJ(2.6)
  40. DHJ(2.7)
  41. DHJ(3)
  42. DHJ(k) implies multidimensional DHJ(k)
  43. DJH(1,3)
  44. Definable Banach Spaces
  45. Density
  46. Density increment method
  47. Deolalikar P vs NP paper
  48. Depth-first search
  49. Depth-first search for multiplicative sequences
  50. Dhj-lown-lower.tex

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