Short pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #1 to #50.
- (hist) DJH(1,3) [0 bytes]
- (hist) Benchmarks of small admissible tuples [25 bytes]
- (hist) Biblio.tex [44 bytes]
- (hist) Sequence of length 3250 [79 bytes]
- (hist) Szemerédi's regularity lemma [119 bytes]
- (hist) Outro.tex [208 bytes]
- (hist) The complexity class DTIME [436 bytes]
- (hist) Hindman's theorem [454 bytes]
- (hist) Dhj.tex [477 bytes]
- (hist) Smooth number [498 bytes]
- (hist) Carlson-Simpson theorem [561 bytes]
- (hist) Discretized Borel Determinacy and P=NP [588 bytes]
- (hist) "New Proof" grant acknowledgments [645 bytes]
- (hist) The HAP-subsequence structure of that sequence [708 bytes]
- (hist) Cramer's conjecture [724 bytes]
- (hist) T2(x) = -T3(x) [735 bytes]
- (hist) Discrete logarithm [745 bytes]
- (hist) Cramer's random model for the primes [757 bytes]
- (hist) Convert raw input string into CSV table [765 bytes]
- (hist) Side Proof 9 [766 bytes]
- (hist) Density [795 bytes]
- (hist) The complexity class BQP [795 bytes]
- (hist) Immerman-Vardi theorem [798 bytes]
- (hist) P=NP implies a deterministic algorithm to find primes [819 bytes]
- (hist) Kruskal-Katona theorem [840 bytes]
- (hist) Lemma 7 [845 bytes]
- (hist) Corners [863 bytes]
- (hist) Prove the result for shifted HAPs instead of HAPs [879 bytes]
- (hist) Polymath4 grant acknowledgments [915 bytes]
- (hist) Sequence of length 714 [922 bytes]
- (hist) Szemerédi's theorem [924 bytes]
- (hist) Roth's theorem [973 bytes]
- (hist) Longest constrained sequences [1,059 bytes]
- (hist) T32-invariant sequences [1,070 bytes]
- (hist) Shifts and signs [1,075 bytes]
- (hist) Generic prime [1,087 bytes]
- (hist) TeX files for first paper [1,099 bytes]
- (hist) Schinzel's hypothesis H [1,130 bytes]
- (hist) Sylvester's sequence [1,151 bytes]
- (hist) Verify the bounded discrepancy of sequence [1,156 bytes]
- (hist) Abstract.tex [1,239 bytes]
- (hist) Sequence of length 1091 [1,267 bytes]
- (hist) Intransitive dice [1,279 bytes]
- (hist) Polymath15 grant acknowledgments [1,297 bytes]
- (hist) Carlson's theorem [1,304 bytes]
- (hist) Verify the bounded discrepancy of an input sequence [1,306 bytes]
- (hist) Graham-Rothschild theorem [1,332 bytes]
- (hist) Corners theorem [1,346 bytes]
- (hist) Folkman's theorem [1,365 bytes]
- (hist) "Low Dimensions" grant acknowledgments [1,390 bytes]