Long pages

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

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

1. (hist) ‎Forced Drift of Six in Multiplicative Sequences ‎[964,670 bytes]
2. (hist) ‎Forced Drifts in Multiplicative Sequences ‎[224,134 bytes]
3. (hist) ‎HAP table for Sequence of length 1112 ‎[188,747 bytes]
4. (hist) ‎Low discrepancy on primes and powers of 2 ‎[107,296 bytes]
5. (hist) ‎Timeline of prime gap bounds ‎[83,733 bytes]
6. (hist) ‎HAP tables for Sequence of length 470 ‎[79,605 bytes]
7. (hist) ‎Moser.tex ‎[72,072 bytes]
8. (hist) ‎The hot spots conjecture ‎[62,155 bytes]
9. (hist) ‎Moser's cube problem ‎[56,872 bytes]
10. (hist) ‎Vectors for the dual SDP ‎[55,205 bytes]
11. (hist) ‎Probabilistic formulation of Hadwiger-Nelson problem ‎[54,262 bytes]
12. (hist) ‎The cost of knowledge ‎[50,983 bytes]
13. (hist) ‎Deolalikar P vs NP paper ‎[50,894 bytes]
14. (hist) ‎Hadwiger-Nelson problem ‎[50,557 bytes]
15. (hist) ‎Scanning code ‎[49,664 bytes]
16. (hist) ‎Journal publishing reform ‎[48,248 bytes]
17. (hist) ‎Bounded gaps between primes ‎[45,290 bytes]
18. (hist) ‎Lookup table C code ‎[43,268 bytes]
19. (hist) ‎Omega(N) ‎[41,117 bytes]
20. (hist) ‎Stability of eigenfunctions ‎[38,845 bytes]
21. (hist) ‎Timeline ‎[38,539 bytes]
22. (hist) ‎Finding narrow admissible tuples ‎[37,512 bytes]
23. (hist) ‎Upper and lower bounds ‎[32,331 bytes]
24. (hist) ‎Second lookup table C code ‎[31,841 bytes]
25. (hist) ‎Coloring Hales-Jewett theorem ‎[31,673 bytes]
26. (hist) ‎The polynomial Hirsch conjecture ‎[31,098 bytes]
27. (hist) ‎Length 1120 sequences ‎[30,959 bytes]
28. (hist) ‎Selberg sieve variational problem ‎[30,808 bytes]
29. (hist) ‎Distribution of primes in smooth moduli ‎[29,739 bytes]
30. (hist) ‎The Erdős discrepancy problem ‎[29,508 bytes]
31. (hist) ‎Finding primes ‎[29,330 bytes]
32. (hist) ‎4D Moser brute force search ‎[28,810 bytes]
33. (hist) ‎Controlling H t-A-B/B 0 ‎[28,254 bytes]
34. (hist) ‎Computer proof that completely multiplicative sequences have discrepancy greater than 2 ‎[27,097 bytes]
35. (hist) ‎Human proof of the 3D Pareto-optimal Moser statistics ‎[26,910 bytes]
36. (hist) ‎Fujimura's problem ‎[26,809 bytes]
37. (hist) ‎Line-free sets correlate locally with complexity-1 sets ‎[24,792 bytes]
38. (hist) ‎Coloring R 2 ‎[24,686 bytes]
39. (hist) ‎Effective bounds on H t - second approach ‎[24,196 bytes]
40. (hist) ‎Austin's proof II ‎[23,190 bytes]
41. (hist) ‎Polymath15 test problem ‎[23,012 bytes]
42. (hist) ‎ABC conjecture ‎[22,952 bytes]
43. (hist) ‎Dhj-lown.tex ‎[22,932 bytes]
44. (hist) ‎Second attempt at computing H t(x) for negative t ‎[22,264 bytes]
45. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 2 ‎[22,123 bytes]
46. (hist) ‎Obtaining the correct bound in Roth's discrepancy theorem ‎[22,003 bytes]
47. (hist) ‎Controlling A+B/B 0 ‎[21,641 bytes]
48. (hist) ‎Effective bounds on H t ‎[20,850 bytes]
49. (hist) ‎Hyper-optimistic conjecture ‎[20,735 bytes]
50. (hist) ‎Imo 2009 q6 ‎[20,704 bytes]
51. (hist) ‎Discrepancy 3 multiplicative sequence of length 13186 ‎[20,326 bytes]
52. (hist) ‎An outline of a density-increment argument ‎[20,132 bytes]
53. (hist) ‎Algebraic formulation of Hadwiger-Nelson problem ‎[19,919 bytes]
54. (hist) ‎Asymptotics of H t ‎[19,908 bytes]
55. (hist) ‎Rota's conjecture ‎[19,743 bytes]
56. (hist) ‎Outline.tex ‎[19,589 bytes]
57. (hist) ‎Quantum Arrow's Theorem ‎[18,579 bytes]
58. (hist) ‎Lattice approach ‎[18,569 bytes]
59. (hist) ‎Introduction.tex ‎[18,075 bytes]
60. (hist) ‎Moser-lower.tex ‎[17,133 bytes]
61. (hist) ‎Austin's proof ‎[16,491 bytes]
62. (hist) ‎A second outline of a density-increment argument ‎[16,130 bytes]
63. (hist) ‎Random k-SAT ‎[15,895 bytes]
64. (hist) ‎Concepts.tex ‎[15,593 bytes]
65. (hist) ‎Multiplicative sequences ‎[15,250 bytes]
66. (hist) ‎DHJ(3) ‎[15,113 bytes]
67. (hist) ‎Equal-slices measure ‎[14,762 bytes]
68. (hist) ‎Proof of DHJ(3) via density-increment ‎[14,554 bytes]
69. (hist) ‎Passing between measures ‎[14,076 bytes]
70. (hist) ‎Online reactions to Deolalikar P vs NP paper ‎[14,017 bytes]
71. (hist) ‎Furstenberg-Katznelson argument ‎[13,482 bytes]
72. (hist) ‎Intro.tex ‎[13,445 bytes]
73. (hist) ‎Ajtai-Szemerédi's proof of the corners theorem ‎[13,186 bytes]
74. (hist) ‎Maple calculations ‎[13,054 bytes]
75. (hist) ‎Main Page ‎[12,920 bytes]
76. (hist) ‎Dynamics of zeros ‎[12,781 bytes]
77. (hist) ‎Equal-slices.tex ‎[12,728 bytes]
78. (hist) ‎A second Fourier decomposition related to Sperner's theorem ‎[12,585 bytes]
79. (hist) ‎De Bruijn-Newman constant ‎[12,480 bytes]
80. (hist) ‎Polylog parameterizability ‎[12,331 bytes]
81. (hist) ‎Notes on polytope decomposition ‎[12,285 bytes]
82. (hist) ‎4D Moser sets with d at least 4 have at most 40 points ‎[12,230 bytes]
83. (hist) ‎Optimal a-set pairs ‎[12,214 bytes]
84. (hist) ‎Bounding the derivative of H t - second approach ‎[12,149 bytes]
85. (hist) ‎Thin triangles ‎[12,062 bytes]
86. (hist) ‎Dickson-Hardy-Littlewood theorems ‎[12,060 bytes]
87. (hist) ‎Theproof.tex ‎[12,015 bytes]
88. (hist) ‎Refined greedy computation of multiplicative sequences ‎[11,987 bytes]
89. (hist) ‎The Erdos-Rado sunflower lemma ‎[11,890 bytes]
90. (hist) ‎Excluding bichromatic vertices ‎[11,778 bytes]
91. (hist) ‎Finding optimal k0 values ‎[11,483 bytes]
92. (hist) ‎Side Proof 4 ‎[11,353 bytes]
93. (hist) ‎Experimental results ‎[11,349 bytes]
94. (hist) ‎Prime counting function ‎[11,233 bytes]
95. (hist) ‎Limits with better properties ‎[11,080 bytes]
96. (hist) ‎Estimating a sum ‎[10,996 bytes]
97. (hist) ‎Measures.tex ‎[10,956 bytes]
98. (hist) ‎Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎[10,949 bytes]
99. (hist) ‎Imo 2012 ‎[10,759 bytes]
100. (hist) ‎Imo 2010 ‎[10,747 bytes]

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