# Pages without language links

From Polymath1Wiki

The following pages do not link to other language versions.

Showing below up to **100** results in range #**1** to #**100**.

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)

- "Low Dimensions" grant acknowledgments
- "New Proof" grant acknowledgments
- 3D Moser statistics
- 4D Moser brute force search
- 4D Moser sets with d at least 2 have at most 42 points
- 4D Moser sets with d at least 3 has at most 41 points
- 4D Moser sets with d at least 4 have at most 40 points
- 4th roots of unity
- 6th roots of unity
- A-statistics code
- ABC conjecture
- A Hilbert space lemma
- A general partitioning principle
- A general result about density increments
- A second Fourier decomposition related to Sperner's theorem
- A second outline of a density-increment argument
- Abstract.tex
- Abstract regularity lemma
- Ajtai-Szemerédi's proof of the corners theorem
- Algebraic formulation of Hadwiger-Nelson problem
- Algorithm for finding multiplicative sequences with bounded discrepancy
- An efficient algorithm exists if Cramer's conjecture holds
- An outline of a density-increment argument
- Asymptotics of H t
- 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 derivative of H t
- Bounding the derivative of H t - second approach
- Bounding the derivative of H t - third approach
- Bounding the discrepancy in terms of the common difference
- 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
- Coloring R 2
- 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
- Controlling A+B/B 0
- Controlling H t-A-B/B 0
- 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)
- De Bruijn-Newman constant
- 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
- Dhj-lown.tex
- Dhj.bib
- Dhj.sty
- Dhj.tex
- Dickson-Hardy-Littlewood theorems
- Different upper and lower bound
- Dirichlet inverses
- Discrepancy 3 multiplicative sequence of length 13186
- Discrete logarithm
- Discretized Borel Determinacy and P=NP
- Distribution of primes in smooth moduli
- Drift
- Dynamics of zeros
- Easy.tex
- Effective bounds on H t
- Effective bounds on H t - second approach
- Equal-slices.tex
- Equal-slices distribution for DHJ(k)
- Equal-slices measure
- Ergodic-inspired methods
- Ergodic perspective
- Estimate the number of discrepancy 2 sequences