# Oldest pages

From Polymath1Wiki

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

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

- Szemerédi's combinatorial proof of Roth's theorem (08:51, 14 February 2009)
- Triangle removal lemma (15:46, 14 February 2009)
- Szemerédi's original proof of Szemerédi's theorem (09:35, 15 February 2009)
- Kruskal-Katona theorem (15:11, 15 February 2009)
- Ergodic perspective (18:16, 15 February 2009)
- Carlson's theorem (23:51, 15 February 2009)
- Carlson-Simpson theorem (23:52, 15 February 2009)
- Stirling's formula (09:25, 16 February 2009)
- Concentration of measure (09:30, 16 February 2009)
- Graham-Rothschild theorem (15:00, 16 February 2009)
- Combinatorial subspace (15:16, 16 February 2009)
- Szemerédi's regularity lemma (15:58, 16 February 2009)
- Unsolved problems (04:50, 17 February 2009)
- DHJ(1,3) (04:43, 18 February 2009)
- Furstenberg correspondence principle (22:42, 19 February 2009)
- Word algebra (16:59, 20 February 2009)
- Slice (12:47, 21 February 2009)
- Influence of variables (04:55, 22 February 2009)
- Line (05:01, 22 February 2009)
- Density increment method (10:15, 22 February 2009)
- Density (04:33, 23 February 2009)
- DHJ(2.7) (21:29, 23 February 2009)
- DHJ(2.6) (21:29, 23 February 2009)
- Furstenberg-Katznelson argument (17:43, 24 February 2009)
- Szemerédi's theorem (16:17, 26 February 2009)
- A second Fourier decomposition related to Sperner's theorem (13:37, 27 February 2009)
- Ajtai-Szemerédi's proof of the corners theorem (08:43, 2 March 2009)
- Fourier-analytic proof of Sperner (03:43, 3 March 2009)
- DHJ(3) (09:30, 5 March 2009)
- Corners (17:17, 8 March 2009)
- An outline of a density-increment argument (20:32, 8 March 2009)
- Correlation with a 1-set implies correlation with a subspace (09:20, 9 March 2009)
- Equal-slices distribution for DHJ(k) (16:37, 10 March 2009)
- Austin's proof (14:35, 12 March 2009)
- Bibliography (16:34, 12 March 2009)
- Abstract regularity lemma (00:43, 14 March 2009)
- Tidy problem page (03:32, 14 March 2009)
- Sperner's theorem (05:15, 17 March 2009)
- A second outline of a density-increment argument (04:59, 18 March 2009)
- Roth's theorem (15:18, 19 March 2009)
- Proof of DHJ(3) via density-increment (13:58, 20 March 2009)
- Austin's proof II (18:36, 1 April 2009)
- Timeline (15:47, 5 April 2009)
- Higher-dimensional Fujimura (06:28, 14 April 2009)
- IP-Szemerédi theorem (22:58, 15 April 2009)
- A general partitioning principle (11:18, 16 April 2009)
- Outline of first paper (19:08, 21 April 2009)
- Modification of the Ajtai-Szemerédi argument (10:53, 22 April 2009)
- Passing between measures (15:55, 23 April 2009)
- Line free sets correlate locally with dense sets of complexity k-2 (11:10, 24 April 2009)
- DHJ(k) implies multidimensional DHJ(k) (11:10, 24 April 2009)
- Ergodic-inspired methods (22:08, 29 April 2009)
- Biblio.tex (17:01, 1 May 2009)
- A Hilbert space lemma (12:55, 18 May 2009)
- Folkman's theorem (03:05, 21 May 2009)
- Hindman's theorem (03:06, 21 May 2009)
- DJH(1,3) (01:50, 29 May 2009)
- Genetic.tex (17:43, 31 May 2009)
- A general result about density increments (20:54, 4 June 2009)
- Kakeya problem (23:35, 4 June 2009)
- Obstructions to uniformity (00:02, 5 June 2009)
- C code for Moser (19:34, 7 June 2009)
- Lookup table C code (18:14, 9 June 2009)
- 3D Moser statistics (09:05, 10 June 2009)
- A-statistics code (09:06, 10 June 2009)
- Insensitive.tex (12:05, 11 June 2009)
- Lookup table (12:07, 11 June 2009)
- Optimal a-set pairs (12:18, 11 June 2009)
- Optimal a-set pair code (12:18, 11 June 2009)
- Stdout output (15:50, 11 June 2009)
- File output (15:50, 11 June 2009)
- Dhj.bib (11:59, 12 June 2009)
- Second lookup table C code (17:33, 12 June 2009)
- Scanning code (17:34, 12 June 2009)
- Matlab script (07:44, 16 June 2009)
- 4D Moser sets with d at least 4 have at most 40 points (07:47, 16 June 2009)
- 4D Moser sets with d at least 2 have at most 42 points (07:48, 16 June 2009)
- 4D Moser sets with d at least 3 has at most 41 points (07:49, 16 June 2009)
- Human proof of the 3D Pareto-optimal Moser statistics (07:50, 16 June 2009)
- Sperner.tex (20:21, 24 June 2009)
- Outline.tex (20:21, 24 June 2009)
- Easy.tex (20:22, 24 June 2009)
- Outro.tex (20:23, 24 June 2009)
- Equal-slices measure (07:31, 30 June 2009)
- Classification of (6,12,18,4,0) sets (14:33, 2 July 2009)
- 4D Moser brute force search (21:12, 6 July 2009)
- Dhj.sty (12:23, 8 July 2009)
- Abstract.tex (12:23, 8 July 2009)
- Intro.tex (12:24, 8 July 2009)
- Concepts.tex (12:24, 8 July 2009)
- Equal-slices.tex (12:25, 8 July 2009)
- Measures.tex (12:25, 8 July 2009)
- Correlation.tex (12:26, 8 July 2009)
- Partitioning.tex (12:26, 8 July 2009)
- Theproof.tex (12:27, 8 July 2009)
- Maple calculations (20:52, 9 July 2009)
- Coloring Hales-Jewett theorem (10:18, 19 July 2009)
- Fujimura.tex (05:46, 27 July 2009)
- Higherk.tex (05:48, 27 July 2009)
- Coloring.tex (08:08, 28 July 2009)
- The complexity class NP (13:19, 28 July 2009)
- P=NP implies a deterministic algorithm to find primes (13:35, 28 July 2009)
- The complexity class DTIME (13:38, 28 July 2009)
- The complexity class BPP (08:28, 29 July 2009)
- The complexity class P (09:13, 30 July 2009)
- Pseudo-random generators (PRG) (22:21, 31 July 2009)
- The complexity class BQP (14:01, 1 August 2009)
- Finding primes with O(k) random bits (04:07, 3 August 2009)
- Friedlander-Iwaniec theorem (09:08, 8 August 2009)
- Factoring (09:24, 8 August 2009)
- Cramer's random model for the primes (09:39, 8 August 2009)
- Hardy-Littlewood prime tuples conjecture (09:43, 8 August 2009)
- The complexity class promise-BPP (05:56, 9 August 2009)
- List of results implied by the Riemann Hypothesis (13:54, 9 August 2009)
- Iterated sumsets of log-primes (07:01, 12 August 2009)
- Signed sums of prime reciprocals (09:43, 12 August 2009)
- Bertrand's postulate (05:59, 18 August 2009)
- Prime gaps (15:39, 19 August 2009)
- Discrete logarithm (15:52, 19 August 2009)
- Generic prime (16:05, 19 August 2009)
- Smooth number (16:39, 19 August 2009)
- Schinzel's hypothesis H (16:49, 19 August 2009)
- An efficient algorithm exists if Cramer's conjecture holds (17:09, 19 August 2009)
- Cramer's conjecture (17:10, 19 August 2009)
- Odlyzko's method (10:02, 22 August 2009)
- Kolmogorov complexity (05:23, 28 August 2009)
- Prime counting function (12:58, 31 August 2009)
- Polynomial strategy (21:46, 18 September 2009)
- Genetic algorithm (23:15, 19 September 2009)
- Corners theorem (09:15, 16 October 2009)
- TeX files for first paper (09:59, 20 October 2009)
- Line-free sets correlate locally with complexity-1 sets (09:46, 21 October 2009)
- Integer.tex (15:11, 12 December 2009)
- 6th roots of unity (11:01, 9 January 2010)
- 4th roots of unity (11:06, 9 January 2010)
- T32-invariant sequences (06:21, 10 January 2010)
- The HAP-subsequence structure of that sequence (08:49, 10 January 2010)
- T2(x) = -T3(x) (12:03, 10 January 2010)
- T2(x) = -x (12:38, 10 January 2010)
- T2(x) = T5(x) = -x (13:39, 10 January 2010)
- Convert raw input string into CSV table (09:16, 11 January 2010)
- Verify the bounded discrepancy of sequence (11:44, 11 January 2010)
- Verify the bounded discrepancy of an input sequence (17:43, 11 January 2010)
- Sequence of length 1112 (09:02, 12 January 2010)
- HAP table for Sequence of length 1112 (09:04, 12 January 2010)
- HAP tables for Sequence of length 470 (09:17, 12 January 2010)
- Depth-first search (14:06, 12 January 2010)
- The first 1124-sequence (18:43, 12 January 2010)
- T m(x) = (+/-)T n(x) (22:59, 12 January 2010)
- Search for completely multiplicative sequences (01:38, 13 January 2010)
- Proposals for finding long low-discrepancy sequences (03:19, 13 January 2010)
- Limits with better properties (04:02, 14 January 2010)
- Computing a HAP basis (13:44, 14 January 2010)
- Dirichlet inverses (16:01, 14 January 2010)
- Moser.tex (22:42, 15 January 2010)
- Dhj-lown.tex (22:42, 15 January 2010)
- Shifts and signs (10:07, 17 January 2010)
- Length 1124 sequences (13:50, 18 January 2010)
- The prime factors of the places where the first two sequences of length 1124 differ (13:57, 18 January 2010)
- Sequence of length 1091 (14:37, 18 January 2010)
- Dhj-lown-lower.tex (18:33, 19 January 2010)
- Moser-lower.tex (18:34, 19 January 2010)
- Estimate the number of discrepancy 2 sequences (13:20, 20 January 2010)
- Sequences given by modulated Sturmian functions (22:18, 20 January 2010)
- Sequence of length 3250 (01:42, 21 January 2010)
- Short sequences statistics (10:03, 22 January 2010)
- Low discrepancy on PAPs (23:23, 22 January 2010)
- Introduction.tex (23:52, 22 January 2010)
- Outline of second paper (08:27, 23 January 2010)
- First obtain multiplicative structure and then obtain a contradiction (11:27, 23 January 2010)
- Character-like functions (13:46, 24 January 2010)
- Drift (01:21, 25 January 2010)
- Topological dynamics formulation (08:50, 25 January 2010)
- Upper and lower discrepancy (12:59, 25 January 2010)
- Polymath.tex (19:37, 25 January 2010)
- Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity (00:56, 28 January 2010)
- Prove the result for shifted HAPs instead of HAPs (14:02, 28 January 2010)
- Algorithm for finding multiplicative sequences with bounded discrepancy (05:44, 29 January 2010)
- Multiplicative.c (08:43, 2 February 2010)
- Wirsing translation (16:50, 2 February 2010)
- Computer proof that completely multiplicative sequences have discrepancy greater than 2 (08:59, 3 February 2010)
- Multiplicative sequences (19:44, 5 February 2010)
- Discrepancy 3 multiplicative sequence of length 13186 (23:45, 5 February 2010)
- Depth-first search for multiplicative sequences (04:44, 6 February 2010)
- Find a good configuration of HAPs (07:45, 7 February 2010)
- Create tables in an HTML file from an input sequence (17:46, 18 February 2010)
- Pseudointegers (00:17, 23 February 2010)
- Vectors for the dual SDP (11:57, 4 March 2010)
- Forced Drifts in Multiplicative Sequences (19:32, 2 April 2010)
- Forced Drift of Six in Multiplicative Sequences (06:25, 3 April 2010)
- Polymath1 (12:58, 23 April 2010)
- Fourier reduction (16:46, 12 May 2010)
- Omega(N) (10:01, 13 May 2010)
- Generalize to a graph-theoretic formulation (08:39, 25 May 2010)
- Definable Banach Spaces (00:32, 10 June 2010)
- Bounded Dirichlet inverse (22:03, 21 June 2010)
- Representation of the diagonal (08:18, 3 July 2010)
- Obtaining the correct bound in Roth's discrepancy theorem (12:53, 3 July 2010)
- Quasirandomness (05:08, 8 July 2010)
- Roth's Theorem concerning discrepancy on Arithmetic Progression (16:07, 16 July 2010)
- Imo 2010 (04:04, 26 July 2010)
- Sequence of length 714 (05:49, 31 July 2010)
- Refined greedy computation of multiplicative sequences (05:50, 31 July 2010)
- Bounding the discrepancy in terms of the common difference (23:09, 1 August 2010)
- Function field version (05:11, 5 August 2010)
- Immerman-Vardi theorem (07:07, 10 August 2010)
- Update (16:35, 11 August 2010)
- Lindell's Critique (19:18, 11 August 2010)
- Immerman's letter (22:56, 12 August 2010)
- Thue-Morse-Hedlund Sequence (05:26, 13 August 2010)
- Random k-SAT (09:29, 15 August 2010)
- Polylog parameterizability (20:07, 18 August 2010)
- Hyper-optimistic conjecture (14:49, 22 August 2010)
- "Low Dimensions" grant acknowledgments (12:46, 23 August 2010)
- Online reactions to Deolalikar P vs NP paper (23:03, 16 September 2010)
- Matryoshka Sequences (05:28, 29 September 2010)
- Low discrepancy on primes and powers of 2 (05:53, 3 October 2010)
- Longest constrained sequences (10:21, 8 October 2010)
- Length 1120 sequences (11:47, 8 October 2010)
- Updating partial sums with Fenwick tree (18:37, 27 December 2010)
- Basic facts about Bohr sets (08:56, 6 February 2011)
- Dhj.tex (15:14, 6 February 2011)
- BK:Section 3 (20:13, 7 February 2011)
- Improving the bounds for Roth's theorem (04:28, 12 February 2011)
- Finding primes (03:18, 14 February 2011)
- Oracle counterexample to finding pseudoprimes (18:17, 24 February 2011)
- Polymath4 grant acknowledgments (09:15, 3 April 2011)
- The polynomial Hirsch conjecture (12:31, 14 August 2011)
- Deolalikar P vs NP paper (15:42, 30 September 2011)
- Quantum Arrow's Theorem (08:21, 8 October 2011)
- Boshernitzan’s problem (02:55, 3 January 2012)
- Meissel-Lehmer method (22:39, 28 February 2012)
- Original Elsevier statement (11:55, 2 March 2012)
- Imo 2011 (13:20, 3 June 2012)
- Thin triangles (10:50, 12 June 2012)
- Stability of eigenfunctions (14:42, 14 July 2012)
- Overlapping Schwarz (17:39, 18 July 2012)
- Imo 2012 (08:58, 5 August 2012)
- The cost of knowledge (11:30, 28 September 2012)
- Que porra n tem nada pra fazer network penetration test (12:30, 30 December 2012)
- Jun Fukuyama's P≠NP Paper (08:26, 6 February 2013)
- Journal publishing reform (17:31, 10 April 2013)
- Imo 2009 q6 (11:19, 13 June 2013)
- Higher-dimensional DHJ numbers (19:25, 15 June 2013)
- Benchmarks of small admissible tuples (16:30, 20 June 2013)
- W-trick (02:05, 5 July 2013)
- Dickson-Hardy-Littlewood theorems (18:53, 27 July 2013)
- Distribution of primes in smooth moduli (10:56, 11 October 2013)
- Finding optimal k0 values (15:14, 20 October 2013)
- Complexity of a set (12:06, 30 October 2013)