Uncategorized pages

From Polymath1Wiki
Jump to: navigation, search

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

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

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