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
Austin's proofAustin's proof IIBK:Section 3
Basic facts about Bohr setsBenchmarks of small admissible tuplesBertrand's postulate
Biblio.texBibliographyBoshernitzan’s problem
Bounded Dirichlet inverseBounded discrepancy multiplicative functions do not correlate with charactersBounded gaps between primes
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.texConvert raw input string into CSV table
CornersCorners theoremCorrelation.tex
Correlation with a 1-set implies correlation with a subspaceCramer's conjectureCramer's random model for the primes
Create tables in an HTML file from an input sequenceDHJ(1,3)
DHJ(2.6)DHJ(2.7)
DHJ(3)DHJ(k) implies multidimensional DHJ(k)DJH(1,3)
Definable Banach SpacesDensity
Density increment method
Deolalikar P vs NP paper
Depth-first searchDepth-first search for multiplicative sequencesDhj-lown-lower.tex
Dhj-lown.texDhj.bibDhj.sty
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
DriftEasy.texEqual-slices.tex
Equal-slices distribution for DHJ(k)Equal-slices measure
Ergodic-inspired methodsErgodic perspectiveEstimate the number of discrepancy 2 sequences
Experimental resultsFactoringFile output
Find a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinityFind a good configuration of HAPsFind set configurations that imply FUNC
Finding narrow admissible tuplesFinding optimal k0 valuesFinding primes
Finding primes with O(k) random bitsFirst obtain multiplicative structure and then obtain a contradictionFolkman's theorem
Forced Drift of Six in Multiplicative SequencesForced Drifts in Multiplicative SequencesFourier-analytic proof of Sperner
Fourier reductionFrankl's union-closed conjectureFriedlander-Iwaniec theorem
Fujimura's problemFujimura.texFunction field version
Furstenberg-Katznelson argumentFurstenberg correspondence principleGeneralize to a graph-theoretic formulation
Generic primeGenetic.texGenetic algorithm
Graham-Rothschild theoremHAP table for Sequence of length 1112
HAP tables for Sequence of length 470Hardy-Littlewood prime tuples conjecture
Higher-dimensional DHJ numbersHigher-dimensional FujimuraHigherk.tex
Hindman's theoremHorn clause formulationHuman proof of the 3D Pareto-optimal Moser statistics
Human proof that completely multiplicative sequences have discrepancy greater than 2Human proof that completely multiplicative sequences have discrepancy greater than 3
Hyper-optimistic conjectureIP-Szemerédi theoremImmerman's letter
Immerman-Vardi theoremImo 2009 q6Imo 2010
Imo 2011Imo 2012Improving the bounds for Roth's theorem
Influence of variablesInsensitive.texInteger.tex
Intro.texIntroduction.texIterated sumsets of log-primes
Journal publishing reformJun Fukuyama's P≠NP PaperKakeya problem
Kolmogorov complexityKruskal-Katona theorem
Lattice approachLemma 1Lemma 7
Lemma 7.5Lemma 7.6Lemma 8
Length 1120 sequencesLength 1124 sequencesLimits with better properties
Lindell's CritiqueLine
Line-free sets correlate locally with complexity-1 setsLine free sets correlate locally with dense sets of complexity k-2List of results implied by the Riemann Hypothesis
LogoLongest constrained sequencesLookup table
Lookup table C codeLow discrepancy on PAPsLow discrepancy on primes and powers of 2
M=13 TheoremM=13 case of FUNCMain Page
Maple calculationsMatlab scriptMatryoshka Sequences
Maximal discrepancy-2 sequenceMeasures.texMeissel-Lehmer method
Modification of the Ajtai-Szemerédi argumentMoser's cube problem
Moser-lower.texMoser.tex
Multiplicative.cMultiplicative sequencesNotes on polytope decomposition
Obstructions to uniformityObtaining the correct bound in Roth's discrepancy theoremOdlyzko's method
Omega(N)Online reactions to Deolalikar P vs NP paperOptimal a-set pair code
Optimal a-set pairsOracle counterexample to finding pseudoprimesOriginal Elsevier statement
Other proposed projectsOutline.texOutline of first paper
Outline of second paperOutro.texOverlapping Schwarz
P=NP implies a deterministic algorithm to find primesPartitioning.texPassing between measures
Polylog parameterizabilityPolymath.texPolymath1
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 diagonalRota's conjectureRoth's Theorem concerning discrepancy on Arithmetic Progression
Roth's theoremScanning codeSchinzel's hypothesis H
Search for completely multiplicative sequencesSecond lookup table C code
Selberg sieve variational problemSequence of length 1091Sequence of length 1112
Sequence of length 3250Sequence of length 714Sequences given by modulated Sturmian functions
Shifts and signsShort sequences statisticsSide Proof 1
Side Proof 10Side Proof 2Side Proof 3
Side Proof 4Side Proof 5Side Proof 6
Side Proof 7Side Proof 8Side Proof 9
Signed sums of prime reciprocalsSlice
Smooth numberSperner's theorem
Sperner.texStability of eigenfunctionsStdout output
Stirling's formulaSylvester's sequenceSzemerédi's combinatorial proof of Roth's theorem
Szemerédi's original proof of Szemerédi's theoremSzemerédi's regularity lemmaSzemerédi's theorem
T2(x) = -T3(x)T2(x) = -x
T2(x) = T5(x) = -xT32-invariant sequencesT m(x) = (+/-)T n(x)
TeX files for first paperThe Erdos-Rado sunflower lemmaThe Erdős discrepancy problem
The HAP-subsequence structure of that sequenceThe complexity class BPPThe complexity class BQP
The complexity class DTIMEThe complexity class NPThe complexity class P
The complexity class promise-BPPThe cost of knowledgeThe first 1124-sequence
The hot spots conjectureThe polynomial Hirsch conjectureThe prime factors of the places where the first two sequences of length 1124 differ
Theproof.texThin trianglesThue-Morse-Hedlund Sequence
Tidy problem pageTimelineTimeline of prime gap bounds
Topological dynamics formulationTriangle removal lemmaUnsolved problems
UpdateUpdating partial sums with Fenwick treeUpper and lower bounds
Upper and lower discrepancyVectors for the dual SDPVerify the bounded discrepancy of an input sequence
Verify the bounded discrepancy of sequenceW-trickWirsing translation
Word algebra