Pages without language links

From Polymath1Wiki
Jump to: navigation, search

The following pages do not link to other language versions.

Prefix  

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (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. Algebraic formulation of Hadwiger-Nelson problem
  21. Algorithm for finding multiplicative sequences with bounded discrepancy
  22. An efficient algorithm exists if Cramer's conjecture holds
  23. An outline of a density-increment argument
  24. Asymptotics of H t
  25. Austin's proof
  26. Austin's proof II
  27. BK:Section 3
  28. Basic facts about Bohr sets
  29. Benchmarks of small admissible tuples
  30. Bertrand's postulate
  31. Biblio.tex
  32. Bibliography
  33. Boshernitzan’s problem
  34. Bounded Dirichlet inverse
  35. Bounded discrepancy multiplicative functions do not correlate with characters
  36. Bounded gaps between primes
  37. Bounding the derivative of H t
  38. Bounding the derivative of H t - second approach
  39. Bounding the derivative of H t - third approach
  40. Bounding the discrepancy in terms of the common difference
  41. C code for Moser
  42. Carlson's theorem
  43. Carlson-Simpson theorem
  44. Character-like functions
  45. Classification of (6,12,18,4,0) sets
  46. Coloring.tex
  47. Coloring Hales-Jewett theorem
  48. Coloring R 2
  49. Combinatorial subspace
  50. Complexity of a set

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