Uncategorized pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #151 to #200.
- Lemma 7.6
- Lemma 8
- Length 1120 sequences
- Length 1124 sequences
- Limits with better properties
- Lindell's Critique
- Line
- Line-free sets correlate locally with complexity-1 sets
- Line free sets correlate locally with dense sets of complexity k-2
- Linear norm
- Linear norm grant acknowledgments
- List of results implied by the Riemann Hypothesis
- Logo
- Longest constrained sequences
- Lookup table
- Lookup table C code
- Low discrepancy on PAPs
- Low discrepancy on primes and powers of 2
- M=13 Theorem
- M=13 case of FUNC
- Main Page
- Maple calculations
- Matlab script
- Matryoshka Sequences
- Maximal discrepancy-2 sequence
- Measures.tex
- Meissel-Lehmer method
- Modification of the Ajtai-Szemerédi argument
- Moser's cube problem
- Moser-lower.tex
- Moser.tex
- Multiplicative.c
- Multiplicative sequences
- Notes on polytope decomposition
- Obstructions to uniformity
- Obtaining the correct bound in Roth's discrepancy theorem
- Odlyzko's method
- Omega(N)
- Online reactions to Deolalikar P vs NP paper
- Optimal a-set pair code
- Optimal a-set pairs
- Oracle counterexample to finding pseudoprimes
- Original Elsevier statement
- Other proposed projects
- Outline.tex
- Outline of first paper
- Outline of second paper
- Outro.tex
- Overlapping Schwarz
- P=NP implies a deterministic algorithm to find primes