Long pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #151 to #200.
- (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]