Dead-end pages

From Polymath1Wiki
Jump to: navigation, search

The following pages do not link to other pages in Polymath1Wiki.

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

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

  1. "Low Dimensions" grant acknowledgments
  2. "New Proof" grant acknowledgments
  3. 4D Moser sets with d at least 2 have at most 42 points
  4. 4D Moser sets with d at least 3 has at most 41 points
  5. 4D Moser sets with d at least 4 have at most 40 points
  6. 6th roots of unity
  7. A-statistics code
  8. A Hilbert space lemma
  9. Abstract.tex
  10. Abstract regularity lemma
  11. Algebraic formulation of Hadwiger-Nelson problem
  12. Benchmarks of small admissible tuples
  13. Bertrand's postulate
  14. Biblio.tex
  15. Boshernitzan’s problem
  16. Bounded Dirichlet inverse
  17. Bounded discrepancy multiplicative functions do not correlate with characters
  18. Bounding the derivative of H t - second approach
  19. Bounding the derivative of H t - third approach
  20. Bounding the discrepancy in terms of the common difference
  21. C code for Moser
  22. Classification of (6,12,18,4,0) sets
  23. Coloring.tex
  24. Coloring R 2
  25. Computing a HAP basis
  26. Concentration of measure
  27. Concepts.tex
  28. Convert raw input string into CSV table
  29. Correlation.tex
  30. DJH(1,3)
  31. Definable Banach Spaces
  32. Depth-first search
  33. Depth-first search for multiplicative sequences
  34. Dhj-lown-lower.tex
  35. Dhj-lown.tex
  36. Dhj.bib
  37. Dhj.tex
  38. Dirichlet inverses
  39. Discrepancy 3 multiplicative sequence of length 13186
  40. Discretized Borel Determinacy and P=NP
  41. Distribution of primes in smooth moduli
  42. Easy.tex
  43. Equal-slices.tex
  44. Estimate the number of discrepancy 2 sequences
  45. Estimating a sum
  46. Excluding bichromatic vertices
  47. File output
  48. Find set configurations that imply FUNC
  49. Finding primes with O(k) random bits
  50. Fourier-analytic proof of Sperner
  51. Fourier reduction
  52. Fujimura.tex
  53. Function field version
  54. Generalize to a graph-theoretic formulation
  55. Genetic.tex
  56. Genetic algorithm
  57. HAP table for Sequence of length 1112
  58. HAP tables for Sequence of length 470
  59. Higher-dimensional Fujimura
  60. Higherk.tex
  61. Horn clause formulation
  62. Human proof of the 3D Pareto-optimal Moser statistics
  63. Immerman's letter
  64. Immerman-Vardi theorem
  65. Imo 2009 q6
  66. Imo 2010
  67. Imo 2011
  68. Imo 2012
  69. Insensitive.tex
  70. Integer.tex
  71. Intransitive dice
  72. Intro.tex
  73. Introduction.tex
  74. Jun Fukuyama's P≠NP Paper
  75. Kolmogorov complexity
  76. Lattice approach
  77. Length 1120 sequences
  78. Lindell's Critique
  79. Linear norm grant acknowledgments
  80. Longest constrained sequences
  81. Lookup table C code
  82. Low discrepancy on PAPs
  83. Low discrepancy on primes and powers of 2
  84. Maple calculations
  85. Matlab script
  86. Matryoshka Sequences
  87. Maximal discrepancy-2 sequence
  88. Measures.tex
  89. Meissel-Lehmer method
  90. Moser-lower.tex
  91. Moser.tex
  92. Multiplicative.c
  93. Notes on polytope decomposition
  94. Obtaining the correct bound in Roth's discrepancy theorem
  95. Odlyzko's method
  96. Omega(N)
  97. Online reactions to Deolalikar P vs NP paper
  98. Optimal a-set pair code
  99. Original Elsevier statement
  100. Outline.tex
  101. Outline of first paper
  102. Outro.tex
  103. Overlapping Schwarz
  104. P=NP implies a deterministic algorithm to find primes
  105. Partitioning.tex
  106. Polylog parameterizability
  107. Polymath15 grant acknowledgments
  108. Polymath4 grant acknowledgments
  109. Polymath8 grant acknowledgments
  110. Probabilistic formulation of Hadwiger-Nelson problem
  111. Proposals for finding long low-discrepancy sequences
  112. Prove the result for shifted HAPs instead of HAPs
  113. Pseudo-random generators (PRG)
  114. Que porra n tem nada pra fazer network penetration test
  115. Random k-SAT
  116. Refined greedy computation of multiplicative sequences
  117. Riemann-Siegel formula
  118. Rota's conjecture
  119. Roth's Theorem concerning discrepancy on Arithmetic Progression
  120. Scanning code
  121. Search for completely multiplicative sequences
  122. Second attempt at computing H t(x) for negative t
  123. Second lookup table C code
  124. Sequence of length 1091
  125. Sequence of length 3250
  126. Sequence of length 714
  127. Sequences given by modulated Sturmian functions
  128. Shifts and signs
  129. Short sequences statistics
  130. Side Proof 2
  131. Side Proof 5
  132. Side Proof 6
  133. Side Proof 7
  134. Side Proof 8
  135. Side Proof 9
  136. Sperner.tex
  137. Stability of eigenfunctions
  138. Stdout output
  139. Stirling's formula
  140. Szemerédi's regularity lemma
  141. T2(x) = -T3(x)
  142. T2(x) = -x
  143. T2(x) = T5(x) = -x
  144. T32-invariant sequences
  145. The Erdos-Rado sunflower lemma
  146. The HAP-subsequence structure of that sequence
  147. The complexity class BPP
  148. The complexity class BQP
  149. The complexity class DTIME
  150. The complexity class NP
  151. The first 1124-sequence
  152. The polynomial Hirsch conjecture
  153. The prime factors of the places where the first two sequences of length 1124 differ
  154. Theproof.tex
  155. Thue-Morse-Hedlund Sequence
  156. Timeline
  157. Topological dynamics formulation
  158. Update
  159. Updating partial sums with Fenwick tree
  160. Vectors for the dual SDP
  161. Verify the bounded discrepancy of an input sequence
  162. Verify the bounded discrepancy of sequence
  163. W-trick
  164. Wirsing translation
  165. Zero-free regions

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