Long pages

Showing below up to 100 results in range #51 to #150.

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

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]
101. (hist) ‎Word algebra ‎[10,657 bytes]
102. (hist) ‎Density increment method ‎[10,599 bytes]
103. (hist) ‎Find set configurations that imply FUNC ‎[10,532 bytes]
104. (hist) ‎The first 1124-sequence ‎[10,510 bytes]
105. (hist) ‎Linear norm ‎[10,503 bytes]
106. (hist) ‎Zero-free regions ‎[10,474 bytes]
107. (hist) ‎Line free sets correlate locally with dense sets of complexity k-2 ‎[10,416 bytes]
108. (hist) ‎Optimal a-set pair code ‎[10,353 bytes]
109. (hist) ‎Bertrand's postulate ‎[10,225 bytes]
110. (hist) ‎Polymath1 ‎[10,169 bytes]
111. (hist) ‎3D Moser statistics ‎[10,105 bytes]
112. (hist) ‎Depth-first search ‎[10,102 bytes]
113. (hist) ‎Find a good configuration of HAPs ‎[9,967 bytes]
114. (hist) ‎IP-Szemerédi theorem ‎[9,930 bytes]
115. (hist) ‎Pseudointegers ‎[9,794 bytes]
116. (hist) ‎Tidy problem page ‎[9,465 bytes]
117. (hist) ‎Easy.tex ‎[9,055 bytes]
118. (hist) ‎Other proposed projects ‎[8,921 bytes]
119. (hist) ‎Dhj-lown-lower.tex ‎[8,877 bytes]
120. (hist) ‎Sperner.tex ‎[8,669 bytes]
121. (hist) ‎Side Proof 3 ‎[8,653 bytes]
122. (hist) ‎Imo 2011 ‎[8,524 bytes]
123. (hist) ‎Correlation.tex ‎[8,324 bytes]
124. (hist) ‎Matlab script ‎[8,211 bytes]
125. (hist) ‎Lemma 1 ‎[8,167 bytes]
126. (hist) ‎Furstenberg correspondence principle ‎[8,144 bytes]
127. (hist) ‎4D Moser sets with d at least 2 have at most 42 points ‎[8,000 bytes]
128. (hist) ‎Frankl's union-closed conjecture ‎[7,809 bytes]
129. (hist) ‎A general partitioning principle ‎[7,785 bytes]
130. (hist) ‎Insensitive.tex ‎[7,629 bytes]
131. (hist) ‎Oracle counterexample to finding pseudoprimes ‎[7,588 bytes]
132. (hist) ‎Roth's Theorem concerning discrepancy on Arithmetic Progression ‎[7,561 bytes]
133. (hist) ‎Higher-dimensional DHJ numbers ‎[7,473 bytes]
134. (hist) ‎Dirichlet inverses ‎[7,446 bytes]
135. (hist) ‎Modification of the Ajtai-Szemerédi argument ‎[7,441 bytes]
136. (hist) ‎Polymath.tex ‎[7,407 bytes]
137. (hist) ‎Estimate the number of discrepancy 2 sequences ‎[7,186 bytes]
138. (hist) ‎Fourier-analytic proof of Sperner ‎[7,128 bytes]
139. (hist) ‎Iterated sumsets of log-primes ‎[7,118 bytes]
140. (hist) ‎Bounding the derivative of H t - third approach ‎[7,109 bytes]
141. (hist) ‎Bounding the discrepancy in terms of the common difference ‎[7,053 bytes]
142. (hist) ‎Create tables in an HTML file from an input sequence ‎[7,018 bytes]
143. (hist) ‎Update ‎[6,949 bytes]
144. (hist) ‎Side Proof 10 ‎[6,724 bytes]
145. (hist) ‎Low discrepancy on PAPs ‎[6,721 bytes]
146. (hist) ‎Sperner's theorem ‎[6,572 bytes]
147. (hist) ‎DHJ(1,3) ‎[6,550 bytes]
148. (hist) ‎T m(x) = (+/-)T n(x) ‎[6,371 bytes]
149. (hist) ‎Partitioning.tex ‎[6,350 bytes]
150. (hist) ‎Higherk.tex ‎[6,323 bytes]

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