Long pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #101 to #150.
- (hist) Imo 2010 [10,747 bytes]
- (hist) Word algebra [10,657 bytes]
- (hist) Density increment method [10,599 bytes]
- (hist) Find set configurations that imply FUNC [10,532 bytes]
- (hist) The first 1124-sequence [10,510 bytes]
- (hist) Linear norm [10,503 bytes]
- (hist) Zero-free regions [10,474 bytes]
- (hist) Line free sets correlate locally with dense sets of complexity k-2 [10,416 bytes]
- (hist) Optimal a-set pair code [10,353 bytes]
- (hist) Other proposed projects [10,267 bytes]
- (hist) Bertrand's postulate [10,225 bytes]
- (hist) Polymath1 [10,169 bytes]
- (hist) 3D Moser statistics [10,105 bytes]
- (hist) Depth-first search [10,102 bytes]
- (hist) Find a good configuration of HAPs [9,967 bytes]
- (hist) IP-Szemerédi theorem [9,930 bytes]
- (hist) Pseudointegers [9,794 bytes]
- (hist) Tidy problem page [9,465 bytes]
- (hist) Easy.tex [9,055 bytes]
- (hist) Dhj-lown-lower.tex [8,877 bytes]
- (hist) Sperner.tex [8,669 bytes]
- (hist) Side Proof 3 [8,653 bytes]
- (hist) Imo 2011 [8,524 bytes]
- (hist) Correlation.tex [8,324 bytes]
- (hist) Matlab script [8,211 bytes]
- (hist) Lemma 1 [8,167 bytes]
- (hist) Furstenberg correspondence principle [8,144 bytes]
- (hist) 4D Moser sets with d at least 2 have at most 42 points [8,000 bytes]
- (hist) Frankl's union-closed conjecture [7,809 bytes]
- (hist) A general partitioning principle [7,785 bytes]
- (hist) Insensitive.tex [7,629 bytes]
- (hist) Oracle counterexample to finding pseudoprimes [7,588 bytes]
- (hist) Roth's Theorem concerning discrepancy on Arithmetic Progression [7,561 bytes]
- (hist) Higher-dimensional DHJ numbers [7,473 bytes]
- (hist) Dirichlet inverses [7,446 bytes]
- (hist) Modification of the Ajtai-Szemerédi argument [7,441 bytes]
- (hist) Polymath.tex [7,407 bytes]
- (hist) Estimate the number of discrepancy 2 sequences [7,186 bytes]
- (hist) Fourier-analytic proof of Sperner [7,128 bytes]
- (hist) Iterated sumsets of log-primes [7,118 bytes]
- (hist) Bounding the derivative of H t - third approach [7,109 bytes]
- (hist) Bounding the discrepancy in terms of the common difference [7,053 bytes]
- (hist) Create tables in an HTML file from an input sequence [7,018 bytes]
- (hist) Update [6,949 bytes]
- (hist) Side Proof 10 [6,724 bytes]
- (hist) Low discrepancy on PAPs [6,721 bytes]
- (hist) Sperner's theorem [6,572 bytes]
- (hist) DHJ(1,3) [6,550 bytes]
- (hist) T m(x) = (+/-)T n(x) [6,371 bytes]
- (hist) Partitioning.tex [6,350 bytes]