Long pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #51 to #100.
- (hist) Imo 2009 q6 [20,704 bytes]
- (hist) Discrepancy 3 multiplicative sequence of length 13186 [20,326 bytes]
- (hist) An outline of a density-increment argument [20,132 bytes]
- (hist) Algebraic formulation of Hadwiger-Nelson problem [19,919 bytes]
- (hist) Asymptotics of H t [19,908 bytes]
- (hist) Rota's conjecture [19,743 bytes]
- (hist) Outline.tex [19,589 bytes]
- (hist) Quantum Arrow's Theorem [18,579 bytes]
- (hist) Lattice approach [18,569 bytes]
- (hist) Introduction.tex [18,075 bytes]
- (hist) Moser-lower.tex [17,133 bytes]
- (hist) Austin's proof [16,491 bytes]
- (hist) A second outline of a density-increment argument [16,130 bytes]
- (hist) Random k-SAT [15,895 bytes]
- (hist) Concepts.tex [15,593 bytes]
- (hist) Multiplicative sequences [15,250 bytes]
- (hist) DHJ(3) [15,113 bytes]
- (hist) Equal-slices measure [14,762 bytes]
- (hist) Proof of DHJ(3) via density-increment [14,554 bytes]
- (hist) Passing between measures [14,076 bytes]
- (hist) Online reactions to Deolalikar P vs NP paper [14,017 bytes]
- (hist) Furstenberg-Katznelson argument [13,482 bytes]
- (hist) Intro.tex [13,445 bytes]
- (hist) Ajtai-Szemerédi's proof of the corners theorem [13,186 bytes]
- (hist) Main Page [13,091 bytes]
- (hist) Maple calculations [13,054 bytes]
- (hist) Dynamics of zeros [12,781 bytes]
- (hist) Equal-slices.tex [12,728 bytes]
- (hist) De Bruijn-Newman constant [12,697 bytes]
- (hist) A second Fourier decomposition related to Sperner's theorem [12,585 bytes]
- (hist) Polylog parameterizability [12,331 bytes]
- (hist) Notes on polytope decomposition [12,285 bytes]
- (hist) 4D Moser sets with d at least 4 have at most 40 points [12,230 bytes]
- (hist) Optimal a-set pairs [12,214 bytes]
- (hist) Bounding the derivative of H t - second approach [12,149 bytes]
- (hist) Thin triangles [12,062 bytes]
- (hist) Dickson-Hardy-Littlewood theorems [12,060 bytes]
- (hist) Theproof.tex [12,015 bytes]
- (hist) Refined greedy computation of multiplicative sequences [11,987 bytes]
- (hist) The Erdos-Rado sunflower lemma [11,944 bytes]
- (hist) Excluding bichromatic vertices [11,778 bytes]
- (hist) Finding optimal k0 values [11,483 bytes]
- (hist) Side Proof 4 [11,353 bytes]
- (hist) Experimental results [11,349 bytes]
- (hist) Prime counting function [11,233 bytes]
- (hist) Limits with better properties [11,080 bytes]
- (hist) Estimating a sum [10,996 bytes]
- (hist) Measures.tex [10,956 bytes]
- (hist) Human proof that completely multiplicative sequences have discrepancy greater than 3 [10,949 bytes]
- (hist) Imo 2012 [10,759 bytes]