Short pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #151 to #200.
- (hist) DHJ(2.6) [5,155 bytes]
- (hist) BK:Section 3 [5,254 bytes]
- (hist) Multiplicative.c [5,268 bytes]
- (hist) C code for Moser [5,341 bytes]
- (hist) Polymath8 grant acknowledgments [5,366 bytes]
- (hist) Boshernitzan’s problem [5,421 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) Obstructions to uniformity [5,460 bytes]
- (hist) Genetic algorithm [5,490 bytes]
- (hist) Drift [5,553 bytes]
- (hist) Immerman's letter [5,561 bytes]
- (hist) Stdout output [5,585 bytes]
- (hist) Topological dynamics formulation [5,599 bytes]
- (hist) A Hilbert space lemma [5,659 bytes]
- (hist) Ergodic perspective [5,712 bytes]
- (hist) Depth-first search for multiplicative sequences [6,064 bytes]
- (hist) Overlapping Schwarz [6,077 bytes]
- (hist) Outline of second paper [6,145 bytes]
- (hist) Computing a HAP basis [6,179 bytes]
- (hist) A-statistics code [6,211 bytes]
- (hist) Equal-slices distribution for DHJ(k) [6,254 bytes]
- (hist) Higherk.tex [6,323 bytes]
- (hist) Partitioning.tex [6,350 bytes]
- (hist) T m(x) = (+/-)T n(x) [6,371 bytes]
- (hist) DHJ(1,3) [6,550 bytes]
- (hist) Sperner's theorem [6,572 bytes]
- (hist) Low discrepancy on PAPs [6,721 bytes]
- (hist) Side Proof 10 [6,724 bytes]
- (hist) Update [6,949 bytes]
- (hist) Create tables in an HTML file from an input sequence [7,018 bytes]
- (hist) Bounding the discrepancy in terms of the common difference [7,053 bytes]
- (hist) Bounding the derivative of H t - third approach [7,109 bytes]
- (hist) Iterated sumsets of log-primes [7,118 bytes]
- (hist) Fourier-analytic proof of Sperner [7,128 bytes]
- (hist) Estimate the number of discrepancy 2 sequences [7,186 bytes]
- (hist) Polymath.tex [7,407 bytes]
- (hist) Modification of the Ajtai-Szemerédi argument [7,441 bytes]
- (hist) Dirichlet inverses [7,446 bytes]
- (hist) Higher-dimensional DHJ numbers [7,473 bytes]
- (hist) Roth's Theorem concerning discrepancy on Arithmetic Progression [7,561 bytes]
- (hist) Oracle counterexample to finding pseudoprimes [7,588 bytes]
- (hist) Insensitive.tex [7,629 bytes]
- (hist) A general partitioning principle [7,785 bytes]
- (hist) Frankl's union-closed conjecture [7,809 bytes]
- (hist) 4D Moser sets with d at least 2 have at most 42 points [8,000 bytes]
- (hist) Furstenberg correspondence principle [8,144 bytes]
- (hist) Lemma 1 [8,167 bytes]
- (hist) Matlab script [8,211 bytes]
- (hist) Correlation.tex [8,324 bytes]
- (hist) Imo 2011 [8,524 bytes]