Pages without language links

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

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. COVID-19 dataset clearinghouse
42. C code for Moser
43. Carlson's theorem
44. Carlson-Simpson theorem
45. Character-like functions
46. Classification of (6,12,18,4,0) sets
47. Coloring.tex
48. Coloring Hales-Jewett theorem
49. Coloring R 2
50. Combinatorial subspace
51. Complexity of a set
52. Computer proof that completely multiplicative sequences have discrepancy greater than 2
53. Computing a HAP basis
54. Concentration of measure
55. Concepts.tex
56. Controlling A+B/B 0
57. Controlling H t-A-B/B 0
58. Convert raw input string into CSV table
59. Corners
60. Corners theorem
61. Correlation.tex
62. Correlation with a 1-set implies correlation with a subspace
63. Cramer's conjecture
64. Cramer's random model for the primes
65. Create tables in an HTML file from an input sequence
66. DHJ(1,3)
67. DHJ(2.6)
68. DHJ(2.7)
69. DHJ(3)
70. DHJ(k) implies multidimensional DHJ(k)
71. DJH(1,3)
72. De Bruijn-Newman constant
73. Definable Banach Spaces
74. Density
75. Density increment method
76. Deolalikar P vs NP paper
77. Depth-first search
78. Depth-first search for multiplicative sequences
79. Dhj-lown-lower.tex
80. Dhj-lown.tex
81. Dhj.bib
82. Dhj.sty
83. Dhj.tex
84. Dickson-Hardy-Littlewood theorems
85. Different upper and lower bound
86. Dirichlet inverses
87. Discrepancy 3 multiplicative sequence of length 13186
88. Discrete logarithm
89. Discretized Borel Determinacy and P=NP
90. Distribution of primes in smooth moduli
91. Drift
92. Dynamics of zeros
93. Easy.tex
94. Effective bounds on H t
95. Effective bounds on H t - second approach
96. Equal-slices.tex
97. Equal-slices distribution for DHJ(k)
98. Equal-slices measure
99. Ergodic-inspired methods
100. Ergodic perspective
101. Estimate the number of discrepancy 2 sequences
102. Estimating a sum
103. Excluding bichromatic vertices
104. Experimental results
105. Factoring
106. File output
107. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity
108. Find a good configuration of HAPs
109. Find set configurations that imply FUNC
110. Finding narrow admissible tuples
111. Finding optimal k0 values
112. Finding primes
113. Finding primes with O(k) random bits
114. First obtain multiplicative structure and then obtain a contradiction
115. Folkman's theorem
116. Forced Drift of Six in Multiplicative Sequences
117. Forced Drifts in Multiplicative Sequences
118. Fourier-analytic proof of Sperner
119. Fourier reduction
120. Frankl's union-closed conjecture
121. Friedlander-Iwaniec theorem
122. Fujimura's problem
123. Fujimura.tex
124. Function field version
125. Furstenberg-Katznelson argument
126. Furstenberg correspondence principle
127. Generalize to a graph-theoretic formulation
128. Generic prime
129. Genetic.tex
130. Genetic algorithm
131. Graham-Rothschild theorem
132. HAP table for Sequence of length 1112
133. HAP tables for Sequence of length 470
134. Hadwiger-Nelson problem
135. Hardy-Littlewood prime tuples conjecture
136. Higher-dimensional DHJ numbers
137. Higher-dimensional Fujimura
138. Higherk.tex
139. Hindman's theorem
140. Horn clause formulation
141. Human proof of the 3D Pareto-optimal Moser statistics
142. Human proof that completely multiplicative sequences have discrepancy greater than 2
143. Human proof that completely multiplicative sequences have discrepancy greater than 3
144. Hyper-optimistic conjecture
145. IP-Szemerédi theorem
146. Immerman's letter
147. Immerman-Vardi theorem
148. Imo 2009 q6
149. Imo 2010
150. Imo 2011
151. Imo 2012
152. Improving the bounds for Roth's theorem
153. Influence of variables
154. Insensitive.tex
155. Integer.tex
156. Intransitive dice
157. Intro.tex
158. Introduction.tex
159. Iterated sumsets of log-primes
160. Journal publishing reform
161. Jun Fukuyama's P≠NP Paper
162. Kakeya problem
163. Kolmogorov complexity
164. Kruskal-Katona theorem
165. Lattice approach
166. Lemma 1
167. Lemma 7
168. Lemma 7.5
169. Lemma 7.6
170. Lemma 8
171. Length 1120 sequences
172. Length 1124 sequences
173. Limits with better properties
174. Lindell's Critique
175. Line
176. Line-free sets correlate locally with complexity-1 sets
177. Line free sets correlate locally with dense sets of complexity k-2
178. Linear norm
179. Linear norm grant acknowledgments
180. List of results implied by the Riemann Hypothesis
181. Logo
182. Longest constrained sequences
183. Lookup table
184. Lookup table C code
185. Low discrepancy on PAPs
186. Low discrepancy on primes and powers of 2
187. M=13 Theorem
188. M=13 case of FUNC
189. Main Page
190. Maple calculations
191. Matlab script
192. Matryoshka Sequences
193. Maximal discrepancy-2 sequence
194. Measures.tex
195. Meissel-Lehmer method
196. Modification of the Ajtai-Szemerédi argument
197. Moser's cube problem
198. Moser-lower.tex
199. Moser.tex
200. Multiplicative.c
201. Multiplicative sequences
202. Notes on polytope decomposition
203. Obstructions to uniformity
204. Obtaining the correct bound in Roth's discrepancy theorem
205. Odlyzko's method
206. Omega(N)
207. Online reactions to Deolalikar P vs NP paper
208. Optimal a-set pair code
209. Optimal a-set pairs
210. Oracle counterexample to finding pseudoprimes
211. Original Elsevier statement
212. Other proposed projects
213. Outline.tex
214. Outline of first paper
215. Outline of second paper
216. Outro.tex
217. Overlapping Schwarz
218. P=NP implies a deterministic algorithm to find primes
219. Partitioning.tex
220. Passing between measures
221. Polylog parameterizability
222. Polymath.tex
223. Polymath1
224. Polymath15 grant acknowledgments
225. Polymath15 test problem
226. Polymath4 grant acknowledgments
227. Polymath8 grant acknowledgments
228. Polynomial strategy
229. Prime counting function
230. Prime gaps
231. Probabilistic formulation of Hadwiger-Nelson problem
232. Proof of DHJ(3) via density-increment
233. Proposals for finding long low-discrepancy sequences
234. Prove the result for shifted HAPs instead of HAPs
235. Pseudo-random generators (PRG)
236. Pseudointegers
237. Quantum Arrow's Theorem
238. Quasirandomness
239. Que porra n tem nada pra fazer network penetration test
240. Random k-SAT
241. Refined greedy computation of multiplicative sequences
242. Representation of the diagonal
243. Riemann-Siegel formula
244. Rota's conjecture
245. Roth's Theorem concerning discrepancy on Arithmetic Progression
246. Roth's theorem
247. Scanning code
248. Schinzel's hypothesis H
249. Search for completely multiplicative sequences
250. Second attempt at computing H t(x) for negative t
251. Second lookup table C code
252. Selberg sieve variational problem
253. Sequence of length 1091
254. Sequence of length 1112
255. Sequence of length 3250
256. Sequence of length 714
257. Sequences given by modulated Sturmian functions
258. Shifts and signs
259. Short sequences statistics
260. Side Proof 1
261. Side Proof 10
262. Side Proof 2
263. Side Proof 3
264. Side Proof 4
265. Side Proof 5
266. Side Proof 6
267. Side Proof 7
268. Side Proof 8
269. Side Proof 9
270. Signed sums of prime reciprocals
271. Slice
272. Smooth number
273. Sperner's theorem
274. Sperner.tex
275. Stability of eigenfunctions
276. Stdout output
277. Stirling's formula
278. Sylvester's sequence
279. Szemerédi's combinatorial proof of Roth's theorem
280. Szemerédi's original proof of Szemerédi's theorem
281. Szemerédi's regularity lemma
282. Szemerédi's theorem
283. T2(x) = -T3(x)
284. T2(x) = -x
285. T2(x) = T5(x) = -x
286. T32-invariant sequences
287. T m(x) = (+/-)T n(x)
288. TeX files for first paper
289. The Erdos-Rado sunflower lemma
290. The Erdős discrepancy problem
291. The HAP-subsequence structure of that sequence
292. The complexity class BPP
293. The complexity class BQP
294. The complexity class DTIME
295. The complexity class NP
296. The complexity class P
297. The complexity class promise-BPP
298. The cost of knowledge
299. The first 1124-sequence
300. The hot spots conjecture
301. The polynomial Hirsch conjecture
302. The prime factors of the places where the first two sequences of length 1124 differ
303. Theproof.tex
304. Thin triangles
305. Thue-Morse-Hedlund Sequence
306. Tidy problem page
307. Timeline
308. Timeline of prime gap bounds
309. Topological dynamics formulation
310. Triangle removal lemma
311. Unsolved problems
312. Update
313. Updating partial sums with Fenwick tree
314. Upper and lower bounds
315. Upper and lower discrepancy
316. Vectors for the dual SDP
317. Verify the bounded discrepancy of an input sequence
318. Verify the bounded discrepancy of sequence
319. W-trick
320. Wirsing translation
321. Word algebra
322. Zero-free regions