Uncategorized pages
From Polymath Wiki
Jump to navigationJump to search
Showing below up to 50 results in range #21 to #70.
- An efficient algorithm exists if Cramer's conjecture holds
- An outline of a density-increment argument
- Austin's proof
- Austin's proof II
- BK:Section 3
- Basic facts about Bohr sets
- Benchmarks of small admissible tuples
- Bertrand's postulate
- Biblio.tex
- Bibliography
- Boshernitzan’s problem
- Bounded Dirichlet inverse
- Bounded discrepancy multiplicative functions do not correlate with characters
- Bounded gaps between primes
- Bounding the discrepancy in terms of the common difference
- COVID-19 dataset clearinghouse
- C code for Moser
- Carlson's theorem
- Carlson-Simpson theorem
- Character-like functions
- Classification of (6,12,18,4,0) sets
- Coloring.tex
- Coloring Hales-Jewett theorem
- Combinatorial subspace
- Complexity of a set
- Computer proof that completely multiplicative sequences have discrepancy greater than 2
- Computing a HAP basis
- Concentration of measure
- Concepts.tex
- Convert raw input string into CSV table
- Corners
- Corners theorem
- Correlation.tex
- Correlation with a 1-set implies correlation with a subspace
- Cramer's conjecture
- Cramer's random model for the primes
- Create tables in an HTML file from an input sequence
- DHJ(1,3)
- DHJ(2.6)
- DHJ(2.7)
- DHJ(3)
- DHJ(k) implies multidimensional DHJ(k)
- DJH(1,3)
- Definable Banach Spaces
- Density
- Density increment method
- Deolalikar P vs NP paper
- Depth-first search
- Depth-first search for multiplicative sequences
- Dhj-lown-lower.tex