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 theoremAlgebraic formulation of Hadwiger-Nelson problem
Algorithm for finding multiplicative sequences with bounded discrepancyAn efficient algorithm exists if Cramer's conjecture holds
An outline of a density-increment argumentAsymptotics of H tAustin's proof
Austin's proof IIBK:Section 3Basic facts about Bohr sets
Benchmarks of small admissible tuplesBertrand's postulateBiblio.tex
BibliographyBoshernitzan’s problemBounded Dirichlet inverse
Bounded discrepancy multiplicative functions do not correlate with charactersBounded gaps between primesBounding the derivative of H t
Bounding the derivative of H t - second approachBounding the derivative of H t - third approachBounding the discrepancy in terms of the common difference
C code for MoserCarlson's theoremCarlson-Simpson theorem
Character-like functionsClassification of (6,12,18,4,0) setsColoring.tex
Coloring Hales-Jewett theoremColoring R 2
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(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 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
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 sumExcluding bichromatic verticesExperimental results
FactoringFile outputFind a different parameter, show that it tends to infinity, and show that that implies that the discrepancy tends to infinity
Find a good configuration of HAPsFind set configurations that imply FUNCFinding narrow admissible tuples
Finding optimal k0 valuesFinding primesFinding primes with O(k) random bits
First obtain multiplicative structure and then obtain a contradictionFolkman's theoremForced Drift of Six in Multiplicative Sequences
Forced Drifts in Multiplicative SequencesFourier-analytic proof of SpernerFourier reduction
Frankl's union-closed conjectureFriedlander-Iwaniec theoremFujimura's problem
Fujimura.texFunction field versionFurstenberg-Katznelson argument
Furstenberg correspondence principleGeneralize to a graph-theoretic formulationGeneric prime
Genetic.texGenetic algorithm
Graham-Rothschild theoremHAP table for Sequence of length 1112HAP tables for Sequence of length 470
Hadwiger-Nelson problemHardy-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
Intransitive diceIntro.texIntroduction.tex
Iterated sumsets of log-primesJournal publishing reformJun Fukuyama's P≠NP Paper
Kakeya problemKolmogorov complexityKruskal-Katona theorem
Lattice approachLemma 1
Lemma 7Lemma 7.5Lemma 7.6
Lemma 8Length 1120 sequencesLength 1124 sequences
Limits with better propertiesLindell's CritiqueLine
Line-free sets correlate locally with complexity-1 setsLine free sets correlate locally with dense sets of complexity k-2
Linear normLinear norm grant acknowledgmentsList 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
Polymath15 test problemPolymath4 grant acknowledgments
Polymath8 grant acknowledgmentsPolynomial strategyPrime counting function
Prime gapsProbabilistic formulation of Hadwiger-Nelson problemProof 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 algebraZero-free regions