There is a new thread for polymath5. One goal that is close to being reached that of deriving a counterexample that is completely multiplicative from any counterexample. Let me update this there is another thread here. It is the fifth thread since the start of the project.
Archive for January, 2010
There is a new thread for Polymath5. Also the paper “Density Hales-Jewett and Moser numbers” will be submitted February 1 to arXiv and to the Szemeredi conference proceedings.
There is a new thread for Polymath5. It now looks like if there is a quasi-multiplicative sequence of bounded discrepancy then there is a multiplicative sequence of bounded discrepancy.
My computer situation has improved.
Polymath5 has officially started. There have been some interesting patterns showing up in some of the examples and now some theoretical questions are being asked. The program is roughly to show that every completely multiplicative sequence cannot have bounded discrepancy then show every low discrepancy sequence can be cleaned up to be quasi-multiplicative and then extend the proof that every completely multiplicative sequence cannot have bounded discrepancy to one showing that quasi-multiplicative sequence cannot have bounded discrepancy.
The deadline for this paper has changed. The deadline has been moved from April to February. See the following post.