Short pages

From Polymath Wiki
Jump to navigationJump to search

Showing below up to 50 results in range #251 to #300.

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

  1. (hist) ‎Furstenberg-Katznelson argument ‎[13,482 bytes]
  2. (hist) ‎Online reactions to Deolalikar P vs NP paper ‎[14,017 bytes]
  3. (hist) ‎Passing between measures ‎[14,076 bytes]
  4. (hist) ‎Proof of DHJ(3) via density-increment ‎[14,554 bytes]
  5. (hist) ‎Equal-slices measure ‎[14,762 bytes]
  6. (hist) ‎DHJ(3) ‎[15,113 bytes]
  7. (hist) ‎Multiplicative sequences ‎[15,250 bytes]
  8. (hist) ‎Concepts.tex ‎[15,593 bytes]
  9. (hist) ‎Random k-SAT ‎[15,895 bytes]
  10. (hist) ‎A second outline of a density-increment argument ‎[16,130 bytes]
  11. (hist) ‎Austin's proof ‎[16,491 bytes]
  12. (hist) ‎Moser-lower.tex ‎[17,133 bytes]
  13. (hist) ‎Introduction.tex ‎[18,075 bytes]
  14. (hist) ‎Lattice approach ‎[18,569 bytes]
  15. (hist) ‎Quantum Arrow's Theorem ‎[18,579 bytes]
  16. (hist) ‎Outline.tex ‎[19,589 bytes]
  17. (hist) ‎Rota's conjecture ‎[19,743 bytes]
  18. (hist) ‎Asymptotics of H t ‎[19,908 bytes]
  19. (hist) ‎Algebraic formulation of Hadwiger-Nelson problem ‎[19,919 bytes]
  20. (hist) ‎An outline of a density-increment argument ‎[20,132 bytes]
  21. (hist) ‎Discrepancy 3 multiplicative sequence of length 13186 ‎[20,326 bytes]
  22. (hist) ‎Imo 2009 q6 ‎[20,704 bytes]
  23. (hist) ‎Hyper-optimistic conjecture ‎[20,735 bytes]
  24. (hist) ‎Effective bounds on H t ‎[20,850 bytes]
  25. (hist) ‎Controlling A+B/B 0 ‎[21,641 bytes]
  26. (hist) ‎Obtaining the correct bound in Roth's discrepancy theorem ‎[22,003 bytes]
  27. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 2 ‎[22,123 bytes]
  28. (hist) ‎Second attempt at computing H t(x) for negative t ‎[22,264 bytes]
  29. (hist) ‎Dhj-lown.tex ‎[22,932 bytes]
  30. (hist) ‎ABC conjecture ‎[22,952 bytes]
  31. (hist) ‎Polymath15 test problem ‎[23,012 bytes]
  32. (hist) ‎Austin's proof II ‎[23,190 bytes]
  33. (hist) ‎Effective bounds on H t - second approach ‎[24,196 bytes]
  34. (hist) ‎Coloring R 2 ‎[24,686 bytes]
  35. (hist) ‎Line-free sets correlate locally with complexity-1 sets ‎[24,792 bytes]
  36. (hist) ‎COVID-19 dataset clearinghouse ‎[26,099 bytes]
  37. (hist) ‎Fujimura's problem ‎[26,809 bytes]
  38. (hist) ‎Human proof of the 3D Pareto-optimal Moser statistics ‎[26,910 bytes]
  39. (hist) ‎Computer proof that completely multiplicative sequences have discrepancy greater than 2 ‎[27,097 bytes]
  40. (hist) ‎Controlling H t-A-B/B 0 ‎[28,254 bytes]
  41. (hist) ‎4D Moser brute force search ‎[28,810 bytes]
  42. (hist) ‎Finding primes ‎[29,330 bytes]
  43. (hist) ‎The Erdős discrepancy problem ‎[29,508 bytes]
  44. (hist) ‎Distribution of primes in smooth moduli ‎[29,739 bytes]
  45. (hist) ‎Selberg sieve variational problem ‎[30,808 bytes]
  46. (hist) ‎Length 1120 sequences ‎[30,959 bytes]
  47. (hist) ‎The polynomial Hirsch conjecture ‎[31,098 bytes]
  48. (hist) ‎Coloring Hales-Jewett theorem ‎[31,673 bytes]
  49. (hist) ‎Second lookup table C code ‎[31,841 bytes]
  50. (hist) ‎Upper and lower bounds ‎[32,331 bytes]

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

Retrieved from "https://michaelnielsen.org/polymath/index.php?title=Special:ShortPages"