Pages without language links
From Polymath Wiki
Jump to navigationJump to search
The following pages do not link to other language versions.
Showing below up to 50 results in range #101 to #150.
- Estimate the number of discrepancy 2 sequences
- Estimating a sum
- Excluding bichromatic vertices
- Experimental results
- Factoring
- File output
- Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity
- Find a good configuration of HAPs
- Find set configurations that imply FUNC
- Finding narrow admissible tuples
- Finding optimal k0 values
- Finding primes
- Finding primes with O(k) random bits
- First obtain multiplicative structure and then obtain a contradiction
- Folkman's theorem
- Forced Drift of Six in Multiplicative Sequences
- Forced Drifts in Multiplicative Sequences
- Fourier-analytic proof of Sperner
- Fourier reduction
- Frankl's union-closed conjecture
- Friedlander-Iwaniec theorem
- Fujimura's problem
- Fujimura.tex
- Function field version
- Furstenberg-Katznelson argument
- Furstenberg correspondence principle
- Generalize to a graph-theoretic formulation
- Generic prime
- Genetic.tex
- Genetic algorithm
- Graham-Rothschild theorem
- HAP table for Sequence of length 1112
- HAP tables for Sequence of length 470
- Hadwiger-Nelson problem
- Hardy-Littlewood prime tuples conjecture
- Higher-dimensional DHJ numbers
- Higher-dimensional Fujimura
- Higherk.tex
- Hindman's theorem
- Horn clause formulation
- Human proof of the 3D Pareto-optimal Moser statistics
- Human proof that completely multiplicative sequences have discrepancy greater than 2
- Human proof that completely multiplicative sequences have discrepancy greater than 3
- Hyper-optimistic conjecture
- IP-Szemerédi theorem
- Immerman's letter
- Immerman-Vardi theorem
- Imo 2009 q6
- Imo 2010
- Imo 2011