Long pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 100 results in range #151 to #250.
- (hist) Higherk.tex [6,323 bytes]
- (hist) Equal-slices distribution for DHJ(k) [6,254 bytes]
- (hist) A-statistics code [6,211 bytes]
- (hist) Computing a HAP basis [6,179 bytes]
- (hist) Outline of second paper [6,145 bytes]
- (hist) Overlapping Schwarz [6,077 bytes]
- (hist) Depth-first search for multiplicative sequences [6,064 bytes]
- (hist) Ergodic perspective [5,712 bytes]
- (hist) A Hilbert space lemma [5,659 bytes]
- (hist) Topological dynamics formulation [5,599 bytes]
- (hist) Stdout output [5,585 bytes]
- (hist) Immerman's letter [5,561 bytes]
- (hist) Drift [5,553 bytes]
- (hist) Genetic algorithm [5,490 bytes]
- (hist) Obstructions to uniformity [5,460 bytes]
- (hist) Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity [5,449 bytes]
- (hist) Boshernitzan’s problem [5,421 bytes]
- (hist) Polymath8 grant acknowledgments [5,366 bytes]
- (hist) C code for Moser [5,341 bytes]
- (hist) Multiplicative.c [5,268 bytes]
- (hist) BK:Section 3 [5,254 bytes]
- (hist) DHJ(2.6) [5,155 bytes]
- (hist) 4D Moser sets with d at least 3 has at most 41 points [5,067 bytes]
- (hist) Bounded discrepancy multiplicative functions do not correlate with characters [5,056 bytes]
- (hist) Lemma 8 [4,999 bytes]
- (hist) Lemma 7.5 [4,941 bytes]
- (hist) Maximal discrepancy-2 sequence [4,928 bytes]
- (hist) Side Proof 2 [4,853 bytes]
- (hist) Lindell's Critique [4,820 bytes]
- (hist) Jun Fukuyama's P≠NP Paper [4,808 bytes]
- (hist) Riemann-Siegel formula [4,765 bytes]
- (hist) Pseudo-random generators (PRG) [4,736 bytes]
- (hist) Updating partial sums with Fenwick tree [4,712 bytes]
- (hist) Integer.tex [4,708 bytes]
- (hist) Kakeya problem [4,701 bytes]
- (hist) Lookup table [4,631 bytes]
- (hist) Wirsing translation [4,551 bytes]
- (hist) Ergodic-inspired methods [4,540 bytes]
- (hist) Bounding the derivative of H t [4,473 bytes]
- (hist) Fourier reduction [4,297 bytes]
- (hist) Outline of first paper [4,289 bytes]
- (hist) A general result about density increments [4,156 bytes]
- (hist) Original Elsevier statement [4,139 bytes]
- (hist) Basic facts about Bohr sets [4,137 bytes]
- (hist) Generalize to a graph-theoretic formulation [4,137 bytes]
- (hist) Matryoshka Sequences [4,095 bytes]
- (hist) Abstract regularity lemma [4,045 bytes]
- (hist) Polynomial strategy [4,038 bytes]
- (hist) Triangle removal lemma [4,020 bytes]
- (hist) Classification of (6,12,18,4,0) sets [3,974 bytes]
- (hist) Coloring.tex [3,969 bytes]
- (hist) Bibliography [3,958 bytes]
- (hist) Short sequences statistics [3,900 bytes]
- (hist) Dhj.sty [3,870 bytes]
- (hist) Quasirandomness [3,823 bytes]
- (hist) Unsolved problems [3,730 bytes]
- (hist) Length 1124 sequences [3,729 bytes]
- (hist) Upper and lower discrepancy [3,692 bytes]
- (hist) 4th roots of unity [3,655 bytes]
- (hist) Proposals for finding long low-discrepancy sequences [3,583 bytes]
- (hist) Concentration of measure [3,496 bytes]
- (hist) Side Proof 1 [3,474 bytes]
- (hist) Szemerédi's original proof of Szemerédi's theorem [3,375 bytes]
- (hist) DHJ(2.7) [3,205 bytes]
- (hist) The complexity class P [3,159 bytes]
- (hist) Lemma 7.6 [3,144 bytes]
- (hist) Definable Banach Spaces [3,082 bytes]
- (hist) Complexity of a set [3,043 bytes]
- (hist) List of results implied by the Riemann Hypothesis [3,032 bytes]
- (hist) The complexity class promise-BPP [3,028 bytes]
- (hist) Logo [2,935 bytes]
- (hist) DHJ(k) implies multidimensional DHJ(k) [2,877 bytes]
- (hist) Influence of variables [2,855 bytes]
- (hist) Different upper and lower bound [2,833 bytes]
- (hist) Horn clause formulation [2,778 bytes]
- (hist) Function field version [2,738 bytes]
- (hist) Improving the bounds for Roth's theorem [2,733 bytes]
- (hist) T2(x) = -x [2,710 bytes]
- (hist) Line [2,675 bytes]
- (hist) Higher-dimensional Fujimura [2,574 bytes]
- (hist) Side Proof 6 [2,563 bytes]
- (hist) Que porra n tem nada pra fazer network penetration test [2,545 bytes]
- (hist) Genetic.tex [2,499 bytes]
- (hist) Meissel-Lehmer method [2,436 bytes]
- (hist) Correlation with a 1-set implies correlation with a subspace [2,357 bytes]
- (hist) An efficient algorithm exists if Cramer's conjecture holds [2,335 bytes]
- (hist) Dhj.bib [2,328 bytes]
- (hist) 6th roots of unity [2,290 bytes]
- (hist) Sequence of length 1112 [2,289 bytes]
- (hist) Representation of the diagonal [2,265 bytes]
- (hist) The complexity class BPP [2,225 bytes]
- (hist) Szemerédi's combinatorial proof of Roth's theorem [2,190 bytes]
- (hist) Fujimura.tex [2,139 bytes]
- (hist) Bounded Dirichlet inverse [2,137 bytes]
- (hist) M=13 Theorem [2,086 bytes]
- (hist) Side Proof 5 [2,054 bytes]
- (hist) Side Proof 8 [2,051 bytes]
- (hist) Linear norm grant acknowledgments [1,979 bytes]
- (hist) First obtain multiplicative structure and then obtain a contradiction [1,955 bytes]
- (hist) The complexity class NP [1,899 bytes]