Pages without language links

From Polymath1Wiki
Jump to: navigation, search

The following pages do not link to other language versions.

Prefix  

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

View (previous 250 | next 250) (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. 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. C code for Moser
  42. Carlson's theorem
  43. Carlson-Simpson theorem
  44. Character-like functions
  45. Classification of (6,12,18,4,0) sets
  46. Coloring.tex
  47. Coloring Hales-Jewett theorem
  48. Coloring R 2
  49. Combinatorial subspace
  50. Complexity of a set
  51. Computer proof that completely multiplicative sequences have discrepancy greater than 2
  52. Computing a HAP basis
  53. Concentration of measure
  54. Concepts.tex
  55. Controlling A+B/B 0
  56. Controlling H t-A-B/B 0
  57. Convert raw input string into CSV table
  58. Corners
  59. Corners theorem
  60. Correlation.tex
  61. Correlation with a 1-set implies correlation with a subspace
  62. Cramer's conjecture
  63. Cramer's random model for the primes
  64. Create tables in an HTML file from an input sequence
  65. DHJ(1,3)
  66. DHJ(2.6)
  67. DHJ(2.7)
  68. DHJ(3)
  69. DHJ(k) implies multidimensional DHJ(k)
  70. DJH(1,3)
  71. De Bruijn-Newman constant
  72. Definable Banach Spaces
  73. Density
  74. Density increment method
  75. Deolalikar P vs NP paper
  76. Depth-first search
  77. Depth-first search for multiplicative sequences
  78. Dhj-lown-lower.tex
  79. Dhj-lown.tex
  80. Dhj.bib
  81. Dhj.sty
  82. Dhj.tex
  83. Dickson-Hardy-Littlewood theorems
  84. Different upper and lower bound
  85. Dirichlet inverses
  86. Discrepancy 3 multiplicative sequence of length 13186
  87. Discrete logarithm
  88. Discretized Borel Determinacy and P=NP
  89. Distribution of primes in smooth moduli
  90. Drift
  91. Dynamics of zeros
  92. Easy.tex
  93. Effective bounds on H t
  94. Effective bounds on H t - second approach
  95. Equal-slices.tex
  96. Equal-slices distribution for DHJ(k)
  97. Equal-slices measure
  98. Ergodic-inspired methods
  99. Ergodic perspective
  100. Estimate the number of discrepancy 2 sequences
  101. Estimating a sum
  102. Excluding bichromatic vertices
  103. Experimental results
  104. Factoring
  105. File output
  106. Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity
  107. Find a good configuration of HAPs
  108. Find set configurations that imply FUNC
  109. Finding narrow admissible tuples
  110. Finding optimal k0 values
  111. Finding primes
  112. Finding primes with O(k) random bits
  113. First obtain multiplicative structure and then obtain a contradiction
  114. Folkman's theorem
  115. Forced Drift of Six in Multiplicative Sequences
  116. Forced Drifts in Multiplicative Sequences
  117. Fourier-analytic proof of Sperner
  118. Fourier reduction
  119. Frankl's union-closed conjecture
  120. Friedlander-Iwaniec theorem
  121. Fujimura's problem
  122. Fujimura.tex
  123. Function field version
  124. Furstenberg-Katznelson argument
  125. Furstenberg correspondence principle
  126. Generalize to a graph-theoretic formulation
  127. Generic prime
  128. Genetic.tex
  129. Genetic algorithm
  130. Graham-Rothschild theorem
  131. HAP table for Sequence of length 1112
  132. HAP tables for Sequence of length 470
  133. Hadwiger-Nelson problem
  134. Hardy-Littlewood prime tuples conjecture
  135. Higher-dimensional DHJ numbers
  136. Higher-dimensional Fujimura
  137. Higherk.tex
  138. Hindman's theorem
  139. Horn clause formulation
  140. Human proof of the 3D Pareto-optimal Moser statistics
  141. Human proof that completely multiplicative sequences have discrepancy greater than 2
  142. Human proof that completely multiplicative sequences have discrepancy greater than 3
  143. Hyper-optimistic conjecture
  144. IP-Szemerédi theorem
  145. Immerman's letter
  146. Immerman-Vardi theorem
  147. Imo 2009 q6
  148. Imo 2010
  149. Imo 2011
  150. Imo 2012
  151. Improving the bounds for Roth's theorem
  152. Influence of variables
  153. Insensitive.tex
  154. Integer.tex
  155. Intransitive dice
  156. Intro.tex
  157. Introduction.tex
  158. Iterated sumsets of log-primes
  159. Journal publishing reform
  160. Jun Fukuyama's P≠NP Paper
  161. Kakeya problem
  162. Kolmogorov complexity
  163. Kruskal-Katona theorem
  164. Lattice approach
  165. Lemma 1
  166. Lemma 7
  167. Lemma 7.5
  168. Lemma 7.6
  169. Lemma 8
  170. Length 1120 sequences
  171. Length 1124 sequences
  172. Limits with better properties
  173. Lindell's Critique
  174. Line
  175. Line-free sets correlate locally with complexity-1 sets
  176. Line free sets correlate locally with dense sets of complexity k-2
  177. Linear norm
  178. Linear norm grant acknowledgments
  179. List of results implied by the Riemann Hypothesis
  180. Logo
  181. Longest constrained sequences
  182. Lookup table
  183. Lookup table C code
  184. Low discrepancy on PAPs
  185. Low discrepancy on primes and powers of 2
  186. M=13 Theorem
  187. M=13 case of FUNC
  188. Main Page
  189. Maple calculations
  190. Matlab script
  191. Matryoshka Sequences
  192. Maximal discrepancy-2 sequence
  193. Measures.tex
  194. Meissel-Lehmer method
  195. Modification of the Ajtai-Szemerédi argument
  196. Moser's cube problem
  197. Moser-lower.tex
  198. Moser.tex
  199. Multiplicative.c
  200. Multiplicative sequences
  201. Notes on polytope decomposition
  202. Obstructions to uniformity
  203. Obtaining the correct bound in Roth's discrepancy theorem
  204. Odlyzko's method
  205. Omega(N)
  206. Online reactions to Deolalikar P vs NP paper
  207. Optimal a-set pair code
  208. Optimal a-set pairs
  209. Oracle counterexample to finding pseudoprimes
  210. Original Elsevier statement
  211. Other proposed projects
  212. Outline.tex
  213. Outline of first paper
  214. Outline of second paper
  215. Outro.tex
  216. Overlapping Schwarz
  217. P=NP implies a deterministic algorithm to find primes
  218. Partitioning.tex
  219. Passing between measures
  220. Polylog parameterizability
  221. Polymath.tex
  222. Polymath1
  223. Polymath15 grant acknowledgments
  224. Polymath15 test problem
  225. Polymath4 grant acknowledgments
  226. Polymath8 grant acknowledgments
  227. Polynomial strategy
  228. Prime counting function
  229. Prime gaps
  230. Probabilistic formulation of Hadwiger-Nelson problem
  231. Proof of DHJ(3) via density-increment
  232. Proposals for finding long low-discrepancy sequences
  233. Prove the result for shifted HAPs instead of HAPs
  234. Pseudo-random generators (PRG)
  235. Pseudointegers
  236. Quantum Arrow's Theorem
  237. Quasirandomness
  238. Que porra n tem nada pra fazer network penetration test
  239. Random k-SAT
  240. Refined greedy computation of multiplicative sequences
  241. Representation of the diagonal
  242. Riemann-Siegel formula
  243. Rota's conjecture
  244. Roth's Theorem concerning discrepancy on Arithmetic Progression
  245. Roth's theorem
  246. Scanning code
  247. Schinzel's hypothesis H
  248. Search for completely multiplicative sequences
  249. Second attempt at computing H t(x) for negative t
  250. Second lookup table C code

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