All pages

From Polymath1Wiki
Jump to: navigation, search
All pages
All pages
"Low Dimensions" grant acknowledgments"New Proof" grant acknowledgments3D Moser statistics
4D Moser brute force search4D Moser sets with d at least 2 have at most 42 points4D Moser sets with d at least 3 has at most 41 points
4D Moser sets with d at least 4 have at most 40 points4th roots of unity6th roots of unity
A-statistics codeABC conjecture
A Hilbert space lemmaA general partitioning principleA general result about density increments
A second Fourier decomposition related to Sperner's theoremA second outline of a density-increment argumentAbstract.tex
Abstract regularity lemmaAjtai-Szemerédi's proof of the corners theorem
Algorithm for finding multiplicative sequences with bounded discrepancyAn efficient algorithm exists if Cramer's conjecture holdsAn outline of a density-increment argument
Asymptotics of H tAustin's proofAustin's proof II
BK:Section 3Basic facts about Bohr setsBenchmarks of small admissible tuples
Bertrand's postulateBiblio.texBibliography
Boshernitzan’s problemBounded Dirichlet inverseBounded discrepancy multiplicative functions do not correlate with characters
Bounded gaps between primesBounding the derivative of H tBounding the derivative of H t - second approach
Bounding the discrepancy in terms of the common differenceC code for MoserCarlson's theorem
Carlson-Simpson theoremCharacter-like functionsClassification of (6,12,18,4,0) sets
Coloring.texColoring Hales-Jewett theorem
Combinatorial subspaceComplexity of a set
Computer proof that completely multiplicative sequences have discrepancy greater than 2Computing a HAP basisConcentration of measure
Concepts.texControlling A+B/B 0Controlling H t-A-B/B 0
Convert raw input string into CSV tableCorners
Corners theoremCorrelation.texCorrelation with a 1-set implies correlation with a subspace
Cramer's conjectureCramer's random model for the primesCreate tables in an HTML file from an input sequence
DHJ(k) implies multidimensional DHJ(k)DJH(1,3)De Bruijn-Newman constant
Definable Banach SpacesDensity
Density increment method
Deolalikar P vs NP paper
Depth-first searchDepth-first search for multiplicative sequencesDhj-lown-lower.tex
Dhj.texDickson-Hardy-Littlewood theoremsDifferent upper and lower bound
Dirichlet inversesDiscrepancy 3 multiplicative sequence of length 13186Discrete logarithm
Discretized Borel Determinacy and P=NPDistribution of primes in smooth moduli
DriftDynamics of zerosEasy.tex
Effective bounds on H tEffective bounds on H t - second approachEqual-slices.tex
Equal-slices distribution for DHJ(k)Equal-slices measure
Ergodic-inspired methodsErgodic perspectiveEstimate the number of discrepancy 2 sequences
Estimating a sumExperimental resultsFactoring
File outputFind a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinityFind a good configuration of HAPs
Find set configurations that imply FUNCFinding narrow admissible tuplesFinding optimal k0 values
Finding primesFinding primes with O(k) random bitsFirst obtain multiplicative structure and then obtain a contradiction
Folkman's theoremForced Drift of Six in Multiplicative SequencesForced Drifts in Multiplicative Sequences
Fourier-analytic proof of SpernerFourier reductionFrankl's union-closed conjecture
Friedlander-Iwaniec theoremFujimura's problemFujimura.tex
Function field versionFurstenberg-Katznelson argumentFurstenberg correspondence principle
Generalize to a graph-theoretic formulationGeneric primeGenetic.tex
Genetic algorithmGraham-Rothschild theorem
HAP table for Sequence of length 1112HAP tables for Sequence of length 470
Hardy-Littlewood prime tuples conjectureHigher-dimensional DHJ numbersHigher-dimensional Fujimura
Higherk.texHindman's theoremHorn clause formulation
Human proof of the 3D Pareto-optimal Moser statisticsHuman proof that completely multiplicative sequences have discrepancy greater than 2
Human proof that completely multiplicative sequences have discrepancy greater than 3Hyper-optimistic conjectureIP-Szemerédi theorem
Immerman's letterImmerman-Vardi theoremImo 2009 q6
Imo 2010Imo 2011Imo 2012
Improving the bounds for Roth's theoremInfluence of variablesInsensitive.tex
Integer.texIntransitive diceIntro.tex
Introduction.texIterated sumsets of log-primesJournal publishing reform
Jun Fukuyama's P≠NP PaperKakeya problemKolmogorov complexity
Kruskal-Katona theoremLattice approach
Lemma 1Lemma 7Lemma 7.5
Lemma 7.6Lemma 8Length 1120 sequences
Length 1124 sequencesLimits with better propertiesLindell's Critique
LineLine-free sets correlate locally with complexity-1 sets
Line free sets correlate locally with dense sets of complexity k-2Linear normLinear norm grant acknowledgments
List of results implied by the Riemann HypothesisLogoLongest constrained sequences
Lookup tableLookup table C codeLow discrepancy on PAPs
Low discrepancy on primes and powers of 2M=13 TheoremM=13 case of FUNC
Main PageMaple calculationsMatlab script
Matryoshka SequencesMaximal discrepancy-2 sequenceMeasures.tex
Meissel-Lehmer methodModification of the Ajtai-Szemerédi argumentMoser's cube problem
Multiplicative.cMultiplicative sequences
Notes on polytope decompositionObstructions to uniformityObtaining the correct bound in Roth's discrepancy theorem
Odlyzko's methodOmega(N)Online reactions to Deolalikar P vs NP paper
Optimal a-set pair codeOptimal a-set pairsOracle counterexample to finding pseudoprimes
Original Elsevier statementOther proposed projectsOutline.tex
Outline of first paperOutline of second paperOutro.tex
Overlapping SchwarzP=NP implies a deterministic algorithm to find primesPartitioning.tex
Passing between measuresPolylog parameterizabilityPolymath.tex
Polymath1Polymath15 test problem
Polymath4 grant acknowledgmentsPolymath8 grant acknowledgmentsPolynomial strategy
Prime counting functionPrime gapsProof of DHJ(3) via density-increment
Proposals for finding long low-discrepancy sequencesProve the result for shifted HAPs instead of HAPsPseudo-random generators (PRG)
PseudointegersQuantum Arrow's TheoremQuasirandomness
Que porra n tem nada pra fazer network penetration testRandom k-SATRefined greedy computation of multiplicative sequences
Representation of the diagonalRiemann-Siegel formulaRota's conjecture
Roth's Theorem concerning discrepancy on Arithmetic ProgressionRoth's theoremScanning code
Schinzel's hypothesis HSearch for completely multiplicative sequencesSecond lookup table C code
Selberg sieve variational problemSequence of length 1091
Sequence of length 1112Sequence of length 3250Sequence of length 714
Sequences given by modulated Sturmian functionsShifts and signsShort sequences statistics
Side Proof 1Side Proof 10Side Proof 2
Side Proof 3Side Proof 4Side Proof 5
Side Proof 6Side Proof 7Side Proof 8
Side Proof 9Signed sums of prime reciprocalsSlice
Smooth number
Sperner's theoremSperner.texStability of eigenfunctions
Stdout outputStirling's formulaSylvester's sequence
Szemerédi's combinatorial proof of Roth's theoremSzemerédi's original proof of Szemerédi's theoremSzemerédi's regularity lemma
Szemerédi's theoremT2(x) = -T3(x)
T2(x) = -xT2(x) = T5(x) = -xT32-invariant sequences
T m(x) = (+/-)T n(x)TeX files for first paperThe Erdos-Rado sunflower lemma
The Erdős discrepancy problemThe HAP-subsequence structure of that sequenceThe complexity class BPP
The complexity class BQPThe complexity class DTIMEThe complexity class NP
The complexity class PThe complexity class promise-BPPThe cost of knowledge
The first 1124-sequenceThe hot spots conjectureThe polynomial Hirsch conjecture
The prime factors of the places where the first two sequences of length 1124 differTheproof.texThin triangles
Thue-Morse-Hedlund SequenceTidy problem pageTimeline
Timeline of prime gap boundsTopological dynamics formulationTriangle removal lemma
Unsolved problemsUpdateUpdating partial sums with Fenwick tree
Upper and lower boundsUpper and lower discrepancyVectors for the dual SDP
Verify the bounded discrepancy of an input sequenceVerify the bounded discrepancy of sequenceW-trick
Wirsing translationWord algebra