Uncategorized pages

From Polymath1Wiki
Jump to: navigation, search

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

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

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