Short pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #201 to #250.
- (hist) Side Proof 3 [8,653 bytes]
- (hist) Sperner.tex [8,669 bytes]
- (hist) Dhj-lown-lower.tex [8,877 bytes]
- (hist) Easy.tex [9,055 bytes]
- (hist) Tidy problem page [9,465 bytes]
- (hist) Pseudointegers [9,794 bytes]
- (hist) IP-Szemerédi theorem [9,930 bytes]
- (hist) Find a good configuration of HAPs [9,967 bytes]
- (hist) Depth-first search [10,102 bytes]
- (hist) 3D Moser statistics [10,105 bytes]
- (hist) Polymath1 [10,169 bytes]
- (hist) Bertrand's postulate [10,225 bytes]
- (hist) Other proposed projects [10,267 bytes]
- (hist) Optimal a-set pair code [10,353 bytes]
- (hist) Line free sets correlate locally with dense sets of complexity k-2 [10,416 bytes]
- (hist) Zero-free regions [10,474 bytes]
- (hist) Linear norm [10,503 bytes]
- (hist) The first 1124-sequence [10,510 bytes]
- (hist) Find set configurations that imply FUNC [10,532 bytes]
- (hist) Density increment method [10,599 bytes]
- (hist) Word algebra [10,657 bytes]
- (hist) Imo 2010 [10,747 bytes]
- (hist) Imo 2012 [10,759 bytes]
- (hist) Human proof that completely multiplicative sequences have discrepancy greater than 3 [10,949 bytes]
- (hist) Measures.tex [10,956 bytes]
- (hist) Estimating a sum [10,996 bytes]
- (hist) Limits with better properties [11,080 bytes]
- (hist) Prime counting function [11,233 bytes]
- (hist) Experimental results [11,349 bytes]
- (hist) Side Proof 4 [11,353 bytes]
- (hist) Finding optimal k0 values [11,483 bytes]
- (hist) Excluding bichromatic vertices [11,778 bytes]
- (hist) The Erdos-Rado sunflower lemma [11,944 bytes]
- (hist) Refined greedy computation of multiplicative sequences [11,987 bytes]
- (hist) Theproof.tex [12,015 bytes]
- (hist) Dickson-Hardy-Littlewood theorems [12,060 bytes]
- (hist) Thin triangles [12,062 bytes]
- (hist) Bounding the derivative of H t - second approach [12,149 bytes]
- (hist) Optimal a-set pairs [12,214 bytes]
- (hist) 4D Moser sets with d at least 4 have at most 40 points [12,230 bytes]
- (hist) Notes on polytope decomposition [12,285 bytes]
- (hist) Polylog parameterizability [12,331 bytes]
- (hist) A second Fourier decomposition related to Sperner's theorem [12,585 bytes]
- (hist) De Bruijn-Newman constant [12,697 bytes]
- (hist) Equal-slices.tex [12,728 bytes]
- (hist) Dynamics of zeros [12,781 bytes]
- (hist) Maple calculations [13,054 bytes]
- (hist) Main Page [13,091 bytes]
- (hist) Ajtai-Szemerédi's proof of the corners theorem [13,186 bytes]
- (hist) Intro.tex [13,445 bytes]
